/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/insertion_sort-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:35:01,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:35:01,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:35:01,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:35:01,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:35:01,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:35:01,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:35:01,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:35:01,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:35:01,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:35:01,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:35:01,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:35:01,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:35:01,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:35:01,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:35:01,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:35:01,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:35:01,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:35:01,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:35:01,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:35:01,486 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:35:01,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:35:01,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:35:01,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:35:01,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:35:01,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:35:01,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:35:01,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:35:01,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:35:01,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:35:01,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:35:01,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:35:01,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:35:01,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:35:01,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:35:01,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:35:01,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:35:01,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:35:01,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:35:01,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:35:01,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:35:01,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:35:01,507 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:35:01,514 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:35:01,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:35:01,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:35:01,516 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:35:01,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:35:01,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:35:01,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:35:01,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:35:01,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:35:01,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:35:01,517 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:35:01,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:35:01,517 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:35:01,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:35:01,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:35:01,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:35:01,517 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:35:01,517 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:35:01,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:35:01,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:35:01,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:35:01,518 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:35:01,518 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:35:01,518 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:35:01,518 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:35:01,518 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:35:01,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:35:01,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:35:01,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:35:01,738 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:35:01,739 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:35:01,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort-2.c [2022-04-08 03:35:01,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adc468800/ff71b9ef61b040fb92a13ea29e1b387b/FLAG524e4243d [2022-04-08 03:35:02,165 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:35:02,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-2.c [2022-04-08 03:35:02,177 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adc468800/ff71b9ef61b040fb92a13ea29e1b387b/FLAG524e4243d [2022-04-08 03:35:02,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adc468800/ff71b9ef61b040fb92a13ea29e1b387b [2022-04-08 03:35:02,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:35:02,560 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:35:02,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:35:02,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:35:02,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:35:02,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:35:02" (1/1) ... [2022-04-08 03:35:02,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51973ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:02, skipping insertion in model container [2022-04-08 03:35:02,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:35:02" (1/1) ... [2022-04-08 03:35:02,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:35:02,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:35:02,696 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/insertion_sort-2.c[328,341] [2022-04-08 03:35:02,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:35:02,714 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:35:02,727 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/insertion_sort-2.c[328,341] [2022-04-08 03:35:02,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:35:02,741 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:35:02,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:02 WrapperNode [2022-04-08 03:35:02,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:35:02,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:35:02,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:35:02,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:35:02,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:02" (1/1) ... [2022-04-08 03:35:02,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:02" (1/1) ... [2022-04-08 03:35:02,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:02" (1/1) ... [2022-04-08 03:35:02,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:02" (1/1) ... [2022-04-08 03:35:02,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:02" (1/1) ... [2022-04-08 03:35:02,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:02" (1/1) ... [2022-04-08 03:35:02,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:02" (1/1) ... [2022-04-08 03:35:02,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:35:02,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:35:02,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:35:02,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:35:02,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:02" (1/1) ... [2022-04-08 03:35:02,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:35:02,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:02,806 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:35:02,809 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:35:02,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:35:02,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:35:02,830 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:35:02,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:35:02,830 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:35:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:35:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:35:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:35:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:35:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:35:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 03:35:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:35:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:35:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 03:35:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:35:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:35:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:35:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:35:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:35:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:35:02,890 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:35:02,892 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:35:03,090 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:35:03,095 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:35:03,095 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-08 03:35:03,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:35:03 BoogieIcfgContainer [2022-04-08 03:35:03,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:35:03,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:35:03,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:35:03,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:35:03,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:35:02" (1/3) ... [2022-04-08 03:35:03,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ddf2f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:35:03, skipping insertion in model container [2022-04-08 03:35:03,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:02" (2/3) ... [2022-04-08 03:35:03,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ddf2f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:35:03, skipping insertion in model container [2022-04-08 03:35:03,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:35:03" (3/3) ... [2022-04-08 03:35:03,102 INFO L111 eAbstractionObserver]: Analyzing ICFG insertion_sort-2.c [2022-04-08 03:35:03,105 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:35:03,105 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:35:03,132 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:35:03,137 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:35:03,137 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:35:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 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:35:03,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 03:35:03,166 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:03,167 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:03,168 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:03,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:03,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1914549692, now seen corresponding path program 1 times [2022-04-08 03:35:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:03,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [570011364] [2022-04-08 03:35:03,190 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:35:03,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1914549692, now seen corresponding path program 2 times [2022-04-08 03:35:03,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:03,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717225751] [2022-04-08 03:35:03,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:03,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:03,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:03,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(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(19, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-08 03:35:03,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 03:35:03,403 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #87#return; {34#true} is VALID [2022-04-08 03:35:03,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:03,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(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(19, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-08 03:35:03,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 03:35:03,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #87#return; {34#true} is VALID [2022-04-08 03:35:03,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret15 := main(); {34#true} is VALID [2022-04-08 03:35:03,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {34#true} is VALID [2022-04-08 03:35:03,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {34#true} is VALID [2022-04-08 03:35:03,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~j~0 := 1; {34#true} is VALID [2022-04-08 03:35:03,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-08 03:35:03,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~k~0 := 1; {35#false} is VALID [2022-04-08 03:35:03,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {35#false} is VALID [2022-04-08 03:35:03,407 INFO L272 TraceCheckUtils]: 11: Hoare triple {35#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {35#false} is VALID [2022-04-08 03:35:03,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-08 03:35:03,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-08 03:35:03,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-08 03:35:03,409 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:35:03,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:03,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717225751] [2022-04-08 03:35:03,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717225751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:03,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:03,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:35:03,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:03,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [570011364] [2022-04-08 03:35:03,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [570011364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:03,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:03,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:35:03,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765544592] [2022-04-08 03:35:03,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:03,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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:03,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:03,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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:03,448 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:03,449 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:35:03,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:03,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:35:03,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:35:03,469 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 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 3.6666666666666665) internal successors, (11), 2 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:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:03,552 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-04-08 03:35:03,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:35:03,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-08 03:35:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-08 03:35:03,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-04-08 03:35:03,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:03,656 INFO L225 Difference]: With dead ends: 54 [2022-04-08 03:35:03,657 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 03:35:03,659 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:35:03,661 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 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:35:03,662 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:35:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 03:35:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 03:35:03,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:03,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:03,683 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:03,683 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:03,686 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-08 03:35:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-08 03:35:03,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:03,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:03,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-08 03:35:03,687 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-08 03:35:03,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:03,689 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-08 03:35:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-08 03:35:03,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:03,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:03,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:03,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-08 03:35:03,703 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 15 [2022-04-08 03:35:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:03,703 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-08 03:35:03,704 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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:03,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2022-04-08 03:35:03,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-08 03:35:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 03:35:03,746 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:03,747 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:03,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:35:03,747 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:03,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash 314290466, now seen corresponding path program 1 times [2022-04-08 03:35:03,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:03,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [474341894] [2022-04-08 03:35:03,751 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:35:03,751 INFO L85 PathProgramCache]: Analyzing trace with hash 314290466, now seen corresponding path program 2 times [2022-04-08 03:35:03,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:03,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073767531] [2022-04-08 03:35:03,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:03,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:03,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:03,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#(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(19, 2);call #Ultimate.allocInit(12, 3); {254#true} is VALID [2022-04-08 03:35:03,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-08 03:35:03,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {254#true} {254#true} #87#return; {254#true} is VALID [2022-04-08 03:35:03,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:03,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#(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(19, 2);call #Ultimate.allocInit(12, 3); {254#true} is VALID [2022-04-08 03:35:03,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-08 03:35:03,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {254#true} #87#return; {254#true} is VALID [2022-04-08 03:35:03,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {254#true} call #t~ret15 := main(); {254#true} is VALID [2022-04-08 03:35:03,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {254#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {259#(= main_~j~0 0)} is VALID [2022-04-08 03:35:03,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-08 03:35:03,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} ~j~0 := 1; {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-08 03:35:03,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-08 03:35:03,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} ~k~0 := 1; {261#(and (<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-08 03:35:03,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {261#(and (<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296)) (= (+ (- 1) main_~k~0) 0))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {255#false} is VALID [2022-04-08 03:35:03,933 INFO L272 TraceCheckUtils]: 11: Hoare triple {255#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {255#false} is VALID [2022-04-08 03:35:03,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {255#false} ~cond := #in~cond; {255#false} is VALID [2022-04-08 03:35:03,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {255#false} assume 0 == ~cond; {255#false} is VALID [2022-04-08 03:35:03,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {255#false} assume !false; {255#false} is VALID [2022-04-08 03:35:03,934 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:35:03,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:03,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073767531] [2022-04-08 03:35:03,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073767531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:03,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:03,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:35:03,935 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:03,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [474341894] [2022-04-08 03:35:03,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [474341894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:03,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:03,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:35:03,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326971746] [2022-04-08 03:35:03,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:03,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:03,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:03,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:03,950 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:03,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:35:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:03,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:35:03,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:35:03,953 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:04,148 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-08 03:35:04,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:35:04,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:04,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-08 03:35:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-08 03:35:04,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-08 03:35:04,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:04,203 INFO L225 Difference]: With dead ends: 49 [2022-04-08 03:35:04,204 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 03:35:04,204 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-04-08 03:35:04,207 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:04,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 37 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:04,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 03:35:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-08 03:35:04,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:04,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:04,219 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:04,220 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:04,222 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-08 03:35:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-08 03:35:04,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:04,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:04,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 28 states. [2022-04-08 03:35:04,223 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 28 states. [2022-04-08 03:35:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:04,231 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-08 03:35:04,231 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-08 03:35:04,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:04,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:04,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:04,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-08 03:35:04,234 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2022-04-08 03:35:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:04,234 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-08 03:35:04,235 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:04,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-08 03:35:04,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 03:35:04,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 03:35:04,263 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:04,264 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:04,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:35:04,264 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:04,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:04,265 INFO L85 PathProgramCache]: Analyzing trace with hash 408725728, now seen corresponding path program 1 times [2022-04-08 03:35:04,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:04,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [774852653] [2022-04-08 03:35:04,293 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:04,294 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:04,294 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:04,294 INFO L85 PathProgramCache]: Analyzing trace with hash 408725728, now seen corresponding path program 2 times [2022-04-08 03:35:04,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:04,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947062084] [2022-04-08 03:35:04,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:04,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:04,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:04,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {491#(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(19, 2);call #Ultimate.allocInit(12, 3); {481#true} is VALID [2022-04-08 03:35:04,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-08 03:35:04,484 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {481#true} {481#true} #87#return; {481#true} is VALID [2022-04-08 03:35:04,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:04,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#(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(19, 2);call #Ultimate.allocInit(12, 3); {481#true} is VALID [2022-04-08 03:35:04,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-08 03:35:04,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #87#return; {481#true} is VALID [2022-04-08 03:35:04,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret15 := main(); {481#true} is VALID [2022-04-08 03:35:04,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {481#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {486#(= main_~j~0 0)} is VALID [2022-04-08 03:35:04,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {487#(and (<= (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1) (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296)))) (= main_~j~0 0))} is VALID [2022-04-08 03:35:04,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {487#(and (<= (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1) (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296)))) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {488#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)) (+ main_~SIZE~0 (* (div (+ (* (- 1) main_~j~0) 1) 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:04,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)) (+ main_~SIZE~0 (* (div (+ (* (- 1) main_~j~0) 1) 4294967296) 4294967296))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-08 03:35:04,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~j~0 := 1; {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-08 03:35:04,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-08 03:35:04,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~k~0 := 1; {490#(and (= (+ (- 1) main_~k~0) 0) (<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:35:04,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {490#(and (= (+ (- 1) main_~k~0) 0) (<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {482#false} is VALID [2022-04-08 03:35:04,493 INFO L272 TraceCheckUtils]: 13: Hoare triple {482#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {482#false} is VALID [2022-04-08 03:35:04,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-08 03:35:04,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-08 03:35:04,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-08 03:35:04,494 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:04,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:04,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947062084] [2022-04-08 03:35:04,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947062084] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:04,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877833579] [2022-04-08 03:35:04,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:04,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:04,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:04,504 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:04,505 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:04,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 03:35:04,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:04,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 03:35:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:04,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:05,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2022-04-08 03:35:05,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#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(19, 2);call #Ultimate.allocInit(12, 3); {481#true} is VALID [2022-04-08 03:35:05,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-08 03:35:05,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #87#return; {481#true} is VALID [2022-04-08 03:35:05,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret15 := main(); {481#true} is VALID [2022-04-08 03:35:05,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {481#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {481#true} is VALID [2022-04-08 03:35:05,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {481#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {481#true} is VALID [2022-04-08 03:35:05,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {481#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {481#true} is VALID [2022-04-08 03:35:05,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {481#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {481#true} is VALID [2022-04-08 03:35:05,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {481#true} ~j~0 := 1; {522#(= main_~j~0 1)} is VALID [2022-04-08 03:35:05,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {522#(= main_~j~0 1)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-08 03:35:05,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~k~0 := 1; {490#(and (= (+ (- 1) main_~k~0) 0) (<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:35:05,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {490#(and (= (+ (- 1) main_~k~0) 0) (<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {482#false} is VALID [2022-04-08 03:35:05,010 INFO L272 TraceCheckUtils]: 13: Hoare triple {482#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {482#false} is VALID [2022-04-08 03:35:05,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-08 03:35:05,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-08 03:35:05,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-08 03:35:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 03:35:05,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 03:35:05,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877833579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:05,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 03:35:05,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-08 03:35:05,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:05,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [774852653] [2022-04-08 03:35:05,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [774852653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:05,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:05,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:35:05,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191724064] [2022-04-08 03:35:05,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:05,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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 17 [2022-04-08 03:35:05,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:05,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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:05,027 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:35:05,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:35:05,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:05,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:35:05,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-08 03:35:05,028 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:05,137 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-04-08 03:35:05,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:35:05,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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 17 [2022-04-08 03:35:05,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-08 03:35:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-08 03:35:05,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-08 03:35:05,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:05,178 INFO L225 Difference]: With dead ends: 45 [2022-04-08 03:35:05,179 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 03:35:05,180 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-08 03:35:05,184 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:05,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 72 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:35:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 03:35:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-04-08 03:35:05,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:05,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:05,196 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:05,197 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:05,198 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-08 03:35:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-08 03:35:05,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:05,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:05,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-08 03:35:05,200 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-08 03:35:05,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:05,203 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-08 03:35:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-08 03:35:05,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:05,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:05,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:05,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-08 03:35:05,206 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2022-04-08 03:35:05,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:05,206 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-08 03:35:05,206 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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:05,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-08 03:35:05,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-08 03:35:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 03:35:05,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:05,239 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:05,259 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:05,456 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:05,456 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:05,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:05,457 INFO L85 PathProgramCache]: Analyzing trace with hash -924605581, now seen corresponding path program 1 times [2022-04-08 03:35:05,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:05,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1529915498] [2022-04-08 03:35:05,462 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:05,463 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:05,463 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:05,463 INFO L85 PathProgramCache]: Analyzing trace with hash -924605581, now seen corresponding path program 2 times [2022-04-08 03:35:05,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:05,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059046848] [2022-04-08 03:35:05,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:05,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:05,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:05,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {768#(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(19, 2);call #Ultimate.allocInit(12, 3); {759#true} is VALID [2022-04-08 03:35:05,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {759#true} assume true; {759#true} is VALID [2022-04-08 03:35:05,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {759#true} {759#true} #87#return; {759#true} is VALID [2022-04-08 03:35:05,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {759#true} call ULTIMATE.init(); {768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:05,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#(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(19, 2);call #Ultimate.allocInit(12, 3); {759#true} is VALID [2022-04-08 03:35:05,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {759#true} assume true; {759#true} is VALID [2022-04-08 03:35:05,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {759#true} {759#true} #87#return; {759#true} is VALID [2022-04-08 03:35:05,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {759#true} call #t~ret15 := main(); {759#true} is VALID [2022-04-08 03:35:05,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {759#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {764#(= main_~j~0 0)} is VALID [2022-04-08 03:35:05,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {764#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {764#(= main_~j~0 0)} is VALID [2022-04-08 03:35:05,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {764#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {765#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:05,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {765#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:05,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {767#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:35:05,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {767#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {760#false} is VALID [2022-04-08 03:35:05,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {760#false} #t~short10 := ~i~0 >= 0; {760#false} is VALID [2022-04-08 03:35:05,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {760#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {760#false} is VALID [2022-04-08 03:35:05,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {760#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {760#false} is VALID [2022-04-08 03:35:05,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {760#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {760#false} is VALID [2022-04-08 03:35:05,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {760#false} is VALID [2022-04-08 03:35:05,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {760#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {760#false} is VALID [2022-04-08 03:35:05,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {760#false} ~k~0 := 1; {760#false} is VALID [2022-04-08 03:35:05,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {760#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {760#false} is VALID [2022-04-08 03:35:05,609 INFO L272 TraceCheckUtils]: 19: Hoare triple {760#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {760#false} is VALID [2022-04-08 03:35:05,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {760#false} ~cond := #in~cond; {760#false} is VALID [2022-04-08 03:35:05,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {760#false} assume 0 == ~cond; {760#false} is VALID [2022-04-08 03:35:05,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {760#false} assume !false; {760#false} is VALID [2022-04-08 03:35:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:05,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:05,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059046848] [2022-04-08 03:35:05,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059046848] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:05,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304741919] [2022-04-08 03:35:05,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:05,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:05,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:05,611 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:05,612 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:05,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:05,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:05,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 03:35:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:05,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:05,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {759#true} call ULTIMATE.init(); {759#true} is VALID [2022-04-08 03:35:05,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {759#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(19, 2);call #Ultimate.allocInit(12, 3); {759#true} is VALID [2022-04-08 03:35:05,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {759#true} assume true; {759#true} is VALID [2022-04-08 03:35:05,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {759#true} {759#true} #87#return; {759#true} is VALID [2022-04-08 03:35:05,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {759#true} call #t~ret15 := main(); {759#true} is VALID [2022-04-08 03:35:05,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {759#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {764#(= main_~j~0 0)} is VALID [2022-04-08 03:35:05,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {764#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {764#(= main_~j~0 0)} is VALID [2022-04-08 03:35:05,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {764#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {793#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-08 03:35:05,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {793#(= (+ (- 1) main_~j~0) 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~short10 := ~i~0 >= 0; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~k~0 := 1; {824#(and (= main_~k~0 1) (<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:35:06,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {824#(and (= main_~k~0 1) (<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {760#false} is VALID [2022-04-08 03:35:06,003 INFO L272 TraceCheckUtils]: 19: Hoare triple {760#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {760#false} is VALID [2022-04-08 03:35:06,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {760#false} ~cond := #in~cond; {760#false} is VALID [2022-04-08 03:35:06,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {760#false} assume 0 == ~cond; {760#false} is VALID [2022-04-08 03:35:06,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {760#false} assume !false; {760#false} is VALID [2022-04-08 03:35:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 03:35:06,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:06,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {760#false} assume !false; {760#false} is VALID [2022-04-08 03:35:06,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {760#false} assume 0 == ~cond; {760#false} is VALID [2022-04-08 03:35:06,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {760#false} ~cond := #in~cond; {760#false} is VALID [2022-04-08 03:35:06,364 INFO L272 TraceCheckUtils]: 19: Hoare triple {760#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {760#false} is VALID [2022-04-08 03:35:06,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {852#(not (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {760#false} is VALID [2022-04-08 03:35:06,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~k~0 := 1; {852#(not (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:35:06,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~short10 := ~i~0 >= 0; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {883#(<= 0 (div (+ (* (- 1) (mod main_~j~0 4294967296)) 1) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:06,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {887#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 1) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {883#(<= 0 (div (+ (* (- 1) (mod main_~j~0 4294967296)) 1) 4294967296))} is VALID [2022-04-08 03:35:06,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {887#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 1) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {887#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 1) 4294967296))} is VALID [2022-04-08 03:35:06,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {759#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {887#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 1) 4294967296))} is VALID [2022-04-08 03:35:06,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {759#true} call #t~ret15 := main(); {759#true} is VALID [2022-04-08 03:35:06,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {759#true} {759#true} #87#return; {759#true} is VALID [2022-04-08 03:35:06,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {759#true} assume true; {759#true} is VALID [2022-04-08 03:35:06,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {759#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(19, 2);call #Ultimate.allocInit(12, 3); {759#true} is VALID [2022-04-08 03:35:06,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {759#true} call ULTIMATE.init(); {759#true} is VALID [2022-04-08 03:35:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 03:35:06,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304741919] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:06,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:06,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-08 03:35:06,372 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:06,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1529915498] [2022-04-08 03:35:06,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1529915498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:06,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:06,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:35:06,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765137810] [2022-04-08 03:35:06,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:06,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 23 [2022-04-08 03:35:06,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:06,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:06,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:06,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:35:06,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:06,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:35:06,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-08 03:35:06,388 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:06,622 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-08 03:35:06,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:35:06,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 23 [2022-04-08 03:35:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-08 03:35:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-08 03:35:06,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-08 03:35:06,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:06,673 INFO L225 Difference]: With dead ends: 55 [2022-04-08 03:35:06,673 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 03:35:06,674 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-04-08 03:35:06,674 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 45 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:06,674 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 41 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:06,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 03:35:06,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-04-08 03:35:06,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:06,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:06,685 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:06,685 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:06,686 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-08 03:35:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-08 03:35:06,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:06,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:06,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 36 states. [2022-04-08 03:35:06,687 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 36 states. [2022-04-08 03:35:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:06,688 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-08 03:35:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-08 03:35:06,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:06,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:06,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:06,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:06,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-08 03:35:06,689 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2022-04-08 03:35:06,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:06,690 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-08 03:35:06,690 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:06,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2022-04-08 03:35:06,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-08 03:35:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 03:35:06,714 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:06,714 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:06,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 03:35:06,930 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:06,931 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:06,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:06,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1080556849, now seen corresponding path program 3 times [2022-04-08 03:35:06,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:06,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1852264746] [2022-04-08 03:35:06,936 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:06,936 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:06,936 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:06,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1080556849, now seen corresponding path program 4 times [2022-04-08 03:35:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:06,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358920563] [2022-04-08 03:35:06,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:06,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:07,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:07,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {1179#(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(19, 2);call #Ultimate.allocInit(12, 3); {1161#true} is VALID [2022-04-08 03:35:07,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-08 03:35:07,435 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1161#true} {1161#true} #87#return; {1161#true} is VALID [2022-04-08 03:35:07,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {1161#true} call ULTIMATE.init(); {1179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:07,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#(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(19, 2);call #Ultimate.allocInit(12, 3); {1161#true} is VALID [2022-04-08 03:35:07,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-08 03:35:07,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1161#true} {1161#true} #87#return; {1161#true} is VALID [2022-04-08 03:35:07,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {1161#true} call #t~ret15 := main(); {1161#true} is VALID [2022-04-08 03:35:07,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {1161#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {1166#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-08 03:35:07,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {1166#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1166#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-08 03:35:07,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {1166#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1167#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:07,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {1167#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1167#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:07,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {1167#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:07,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {1168#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:07,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {1168#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {1167#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:07,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {1167#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {1169#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-08 03:35:07,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {1169#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {1170#(and (= (+ (- 1) main_~j~0) 0) (or (not |main_#t~short10|) (and (= |main_~#v~0.offset| 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))))} is VALID [2022-04-08 03:35:07,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {1170#(and (= (+ (- 1) main_~j~0) 0) (or (not |main_#t~short10|) (and (= |main_~#v~0.offset| 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {1171#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-08 03:35:07,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {1171#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1172#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-08 03:35:07,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {1172#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1173#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:07,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {1173#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1174#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:07,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1174#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:07,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {1175#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-08 03:35:07,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {1176#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:35:07,445 INFO L272 TraceCheckUtils]: 21: Hoare triple {1176#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:35:07,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {1177#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1178#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:35:07,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1162#false} is VALID [2022-04-08 03:35:07,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {1162#false} assume !false; {1162#false} is VALID [2022-04-08 03:35:07,445 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:07,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:07,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358920563] [2022-04-08 03:35:07,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358920563] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:07,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037970805] [2022-04-08 03:35:07,446 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:35:07,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:07,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:07,447 INFO L229 MonitoredProcess]: Starting monitored process 4 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:07,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 03:35:07,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:35:07,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:07,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 03:35:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:07,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:07,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:35:07,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 27 [2022-04-08 03:35:07,915 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-08 03:35:07,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-04-08 03:35:07,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {1161#true} call ULTIMATE.init(); {1161#true} is VALID [2022-04-08 03:35:07,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#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(19, 2);call #Ultimate.allocInit(12, 3); {1161#true} is VALID [2022-04-08 03:35:07,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-08 03:35:07,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1161#true} {1161#true} #87#return; {1161#true} is VALID [2022-04-08 03:35:07,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {1161#true} call #t~ret15 := main(); {1161#true} is VALID [2022-04-08 03:35:07,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {1161#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:07,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {1168#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:07,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {1168#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:07,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {1168#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:07,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {1168#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:07,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {1168#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:07,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {1168#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {1167#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:07,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {1167#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {1219#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2022-04-08 03:35:07,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {1219#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0))} #t~short10 := ~i~0 >= 0; {1223#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) |main_#t~short10|)} is VALID [2022-04-08 03:35:07,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {1223#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) |main_#t~short10|)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {1227#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-08 03:35:07,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1231#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} is VALID [2022-04-08 03:35:07,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {1231#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1174#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:07,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {1174#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1174#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:07,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1174#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:07,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {1175#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-08 03:35:07,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {1176#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:35:07,983 INFO L272 TraceCheckUtils]: 21: Hoare triple {1176#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:07,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {1250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:07,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1162#false} is VALID [2022-04-08 03:35:07,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {1162#false} assume !false; {1162#false} is VALID [2022-04-08 03:35:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 03:35:07,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:08,290 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 41 treesize of output 35 [2022-04-08 03:35:08,322 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-04-08 03:35:08,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 90 [2022-04-08 03:35:08,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {1162#false} assume !false; {1162#false} is VALID [2022-04-08 03:35:08,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1162#false} is VALID [2022-04-08 03:35:08,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {1250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:08,487 INFO L272 TraceCheckUtils]: 21: Hoare triple {1176#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:08,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {1273#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {1176#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:35:08,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {1277#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} ~k~0 := 1; {1273#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-08 03:35:08,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {1277#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1277#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:35:08,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {1277#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1277#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:35:08,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {1287#(forall ((v_ArrVal_41 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_41))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1277#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:35:08,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {1291#(or (forall ((v_ArrVal_41 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_41)))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1287#(forall ((v_ArrVal_41 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_41))))} is VALID [2022-04-08 03:35:08,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {1295#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {1291#(or (forall ((v_ArrVal_41 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_41)))) |main_#t~short10|)} is VALID [2022-04-08 03:35:08,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {1299#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {1295#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:35:08,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {1303#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {1299#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:35:08,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {1161#true} ~j~0 := 1; {1303#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-08 03:35:08,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {1161#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1161#true} is VALID [2022-04-08 03:35:08,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {1161#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1161#true} is VALID [2022-04-08 03:35:08,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {1161#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1161#true} is VALID [2022-04-08 03:35:08,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {1161#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1161#true} is VALID [2022-04-08 03:35:08,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {1161#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1161#true} is VALID [2022-04-08 03:35:08,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {1161#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {1161#true} is VALID [2022-04-08 03:35:08,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {1161#true} call #t~ret15 := main(); {1161#true} is VALID [2022-04-08 03:35:08,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1161#true} {1161#true} #87#return; {1161#true} is VALID [2022-04-08 03:35:08,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-08 03:35:08,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#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(19, 2);call #Ultimate.allocInit(12, 3); {1161#true} is VALID [2022-04-08 03:35:08,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {1161#true} call ULTIMATE.init(); {1161#true} is VALID [2022-04-08 03:35:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 03:35:08,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037970805] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:08,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:08,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 29 [2022-04-08 03:35:08,495 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:08,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1852264746] [2022-04-08 03:35:08,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1852264746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:08,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:08,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 03:35:08,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149650018] [2022-04-08 03:35:08,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:08,495 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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 25 [2022-04-08 03:35:08,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:08,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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:08,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:08,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 03:35:08,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:08,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 03:35:08,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2022-04-08 03:35:08,514 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:09,576 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-08 03:35:09,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 03:35:09,577 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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 25 [2022-04-08 03:35:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 79 transitions. [2022-04-08 03:35:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 79 transitions. [2022-04-08 03:35:09,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 79 transitions. [2022-04-08 03:35:09,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:09,648 INFO L225 Difference]: With dead ends: 65 [2022-04-08 03:35:09,648 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 03:35:09,649 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=337, Invalid=1733, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 03:35:09,650 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 86 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:09,650 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 69 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 03:35:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 03:35:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2022-04-08 03:35:09,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:09,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:09,689 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:09,689 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:09,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:09,692 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-08 03:35:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-08 03:35:09,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:09,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:09,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 63 states. [2022-04-08 03:35:09,693 INFO L87 Difference]: Start difference. First operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 63 states. [2022-04-08 03:35:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:09,695 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-08 03:35:09,695 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-08 03:35:09,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:09,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:09,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:09,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-08 03:35:09,697 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 25 [2022-04-08 03:35:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:09,698 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-08 03:35:09,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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:09,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-08 03:35:09,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-08 03:35:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 03:35:09,749 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:09,749 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:09,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:09,966 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:09,967 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:09,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1781621427, now seen corresponding path program 1 times [2022-04-08 03:35:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:09,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1806816159] [2022-04-08 03:35:09,972 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:09,974 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:09,974 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:09,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1781621427, now seen corresponding path program 2 times [2022-04-08 03:35:09,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:09,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848490640] [2022-04-08 03:35:09,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:09,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:10,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:10,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {1728#(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(19, 2);call #Ultimate.allocInit(12, 3); {1720#true} is VALID [2022-04-08 03:35:10,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {1720#true} assume true; {1720#true} is VALID [2022-04-08 03:35:10,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1720#true} {1720#true} #87#return; {1720#true} is VALID [2022-04-08 03:35:10,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {1720#true} call ULTIMATE.init(); {1728#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:10,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {1728#(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(19, 2);call #Ultimate.allocInit(12, 3); {1720#true} is VALID [2022-04-08 03:35:10,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {1720#true} assume true; {1720#true} is VALID [2022-04-08 03:35:10,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1720#true} {1720#true} #87#return; {1720#true} is VALID [2022-04-08 03:35:10,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {1720#true} call #t~ret15 := main(); {1720#true} is VALID [2022-04-08 03:35:10,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {1720#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {1720#true} is VALID [2022-04-08 03:35:10,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {1720#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1720#true} is VALID [2022-04-08 03:35:10,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {1720#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1720#true} is VALID [2022-04-08 03:35:10,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {1720#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1720#true} is VALID [2022-04-08 03:35:10,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {1720#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1720#true} is VALID [2022-04-08 03:35:10,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {1720#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1720#true} is VALID [2022-04-08 03:35:10,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {1720#true} ~j~0 := 1; {1725#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-08 03:35:10,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {1725#(= (+ (- 1) main_~j~0) 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {1726#(and (<= main_~j~0 (+ main_~i~0 1)) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-08 03:35:10,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {1726#(and (<= main_~j~0 (+ main_~i~0 1)) (= (+ (- 1) main_~j~0) 0))} #t~short10 := ~i~0 >= 0; {1727#(and (= (+ (- 1) main_~j~0) 0) |main_#t~short10|)} is VALID [2022-04-08 03:35:10,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {1727#(and (= (+ (- 1) main_~j~0) 0) |main_#t~short10|)} assume !#t~short10; {1721#false} is VALID [2022-04-08 03:35:10,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {1721#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1721#false} is VALID [2022-04-08 03:35:10,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {1721#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1721#false} is VALID [2022-04-08 03:35:10,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {1721#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1721#false} is VALID [2022-04-08 03:35:10,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {1721#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1721#false} is VALID [2022-04-08 03:35:10,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {1721#false} ~k~0 := 1; {1721#false} is VALID [2022-04-08 03:35:10,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {1721#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {1721#false} is VALID [2022-04-08 03:35:10,049 INFO L272 TraceCheckUtils]: 21: Hoare triple {1721#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1721#false} is VALID [2022-04-08 03:35:10,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {1721#false} ~cond := #in~cond; {1721#false} is VALID [2022-04-08 03:35:10,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {1721#false} assume 0 == ~cond; {1721#false} is VALID [2022-04-08 03:35:10,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {1721#false} assume !false; {1721#false} is VALID [2022-04-08 03:35:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 03:35:10,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:10,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848490640] [2022-04-08 03:35:10,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848490640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:10,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:10,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:35:10,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:10,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1806816159] [2022-04-08 03:35:10,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1806816159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:10,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:10,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:35:10,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574982412] [2022-04-08 03:35:10,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:10,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 25 [2022-04-08 03:35:10,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:10,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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:10,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:10,063 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:35:10,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:10,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:35:10,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:35:10,064 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:10,256 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-08 03:35:10,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:35:10,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 25 [2022-04-08 03:35:10,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-08 03:35:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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:10,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-08 03:35:10,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-04-08 03:35:10,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:10,304 INFO L225 Difference]: With dead ends: 82 [2022-04-08 03:35:10,304 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 03:35:10,305 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-08 03:35:10,305 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:10,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 30 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:35:10,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 03:35:10,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2022-04-08 03:35:10,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:10,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:10,346 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:10,346 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:10,347 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-04-08 03:35:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-08 03:35:10,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:10,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:10,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 51 states. [2022-04-08 03:35:10,348 INFO L87 Difference]: Start difference. First operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 51 states. [2022-04-08 03:35:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:10,349 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-04-08 03:35:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-08 03:35:10,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:10,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:10,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:10,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-04-08 03:35:10,351 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 25 [2022-04-08 03:35:10,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:10,351 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-04-08 03:35:10,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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:10,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 54 transitions. [2022-04-08 03:35:10,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-08 03:35:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 03:35:10,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:10,435 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:10,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 03:35:10,435 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1755898038, now seen corresponding path program 1 times [2022-04-08 03:35:10,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:10,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2029707075] [2022-04-08 03:35:10,439 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:10,440 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:10,440 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1755898038, now seen corresponding path program 2 times [2022-04-08 03:35:10,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:10,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626575220] [2022-04-08 03:35:10,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:10,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:10,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:10,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {2114#(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(19, 2);call #Ultimate.allocInit(12, 3); {2095#true} is VALID [2022-04-08 03:35:10,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {2095#true} assume true; {2095#true} is VALID [2022-04-08 03:35:10,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2095#true} {2095#true} #87#return; {2095#true} is VALID [2022-04-08 03:35:10,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {2095#true} call ULTIMATE.init(); {2114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:10,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {2114#(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(19, 2);call #Ultimate.allocInit(12, 3); {2095#true} is VALID [2022-04-08 03:35:10,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {2095#true} assume true; {2095#true} is VALID [2022-04-08 03:35:10,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2095#true} {2095#true} #87#return; {2095#true} is VALID [2022-04-08 03:35:10,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {2095#true} call #t~ret15 := main(); {2095#true} is VALID [2022-04-08 03:35:10,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {2095#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2100#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-08 03:35:10,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {2100#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2100#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-08 03:35:10,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {2100#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2101#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:10,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {2101#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2101#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:10,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {2101#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2102#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:10,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {2102#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2102#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:10,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {2102#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {2101#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:10,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {2101#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2103#(and (= |main_~#v~0.offset| 0) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (and (<= (+ main_~i~0 1) 0) (= (+ (- 1) main_~j~0) 0))))} is VALID [2022-04-08 03:35:10,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {2103#(and (= |main_~#v~0.offset| 0) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (and (<= (+ main_~i~0 1) 0) (= (+ (- 1) main_~j~0) 0))))} #t~short10 := ~i~0 >= 0; {2104#(and (= |main_~#v~0.offset| 0) (or (not |main_#t~short10|) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:10,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {2104#(and (= |main_~#v~0.offset| 0) (or (not |main_#t~short10|) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2105#(and (= |main_~#v~0.offset| 0) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:35:10,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {2105#(and (= |main_~#v~0.offset| 0) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 0 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {2106#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-08 03:35:10,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {2106#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} #t~short10 := ~i~0 >= 0; {2107#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (and (<= 0 (+ main_~i~0 1)) |main_#t~short10|)))} is VALID [2022-04-08 03:35:10,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {2107#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (and (<= 0 (+ main_~i~0 1)) |main_#t~short10|)))} assume !#t~short10; {2108#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-08 03:35:10,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {2108#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2108#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-08 03:35:10,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {2108#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2109#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:10,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {2109#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2109#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:10,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {2109#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2109#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:10,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {2109#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {2110#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-08 03:35:10,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {2110#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {2111#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-08 03:35:10,820 INFO L272 TraceCheckUtils]: 24: Hoare triple {2111#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:35:10,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {2112#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2113#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:35:10,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {2113#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2096#false} is VALID [2022-04-08 03:35:10,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {2096#false} assume !false; {2096#false} is VALID [2022-04-08 03:35:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:10,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:10,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626575220] [2022-04-08 03:35:10,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626575220] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:10,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85082354] [2022-04-08 03:35:10,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:10,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:10,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:10,823 INFO L229 MonitoredProcess]: Starting monitored process 5 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:10,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 03:35:10,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:10,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:10,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 03:35:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:10,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:11,078 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-08 03:35:11,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2022-04-08 03:35:11,339 INFO L356 Elim1Store]: treesize reduction 76, result has 10.6 percent of original size [2022-04-08 03:35:11,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 28 [2022-04-08 03:35:11,711 INFO L356 Elim1Store]: treesize reduction 36, result has 7.7 percent of original size [2022-04-08 03:35:11,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2022-04-08 03:35:11,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {2095#true} call ULTIMATE.init(); {2095#true} is VALID [2022-04-08 03:35:11,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {2095#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(19, 2);call #Ultimate.allocInit(12, 3); {2095#true} is VALID [2022-04-08 03:35:11,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {2095#true} assume true; {2095#true} is VALID [2022-04-08 03:35:11,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2095#true} {2095#true} #87#return; {2095#true} is VALID [2022-04-08 03:35:11,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {2095#true} call #t~ret15 := main(); {2095#true} is VALID [2022-04-08 03:35:11,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {2095#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2095#true} is VALID [2022-04-08 03:35:11,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {2095#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2095#true} is VALID [2022-04-08 03:35:11,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {2095#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2095#true} is VALID [2022-04-08 03:35:11,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {2095#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2095#true} is VALID [2022-04-08 03:35:11,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {2095#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2095#true} is VALID [2022-04-08 03:35:11,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {2095#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2095#true} is VALID [2022-04-08 03:35:11,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {2095#true} ~j~0 := 1; {2151#(= main_~j~0 1)} is VALID [2022-04-08 03:35:11,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {2151#(= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2155#(= (+ main_~i~0 1) 1)} is VALID [2022-04-08 03:35:11,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {2155#(= (+ main_~i~0 1) 1)} #t~short10 := ~i~0 >= 0; {2159#(and |main_#t~short10| (= (+ main_~i~0 1) 1))} is VALID [2022-04-08 03:35:11,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {2159#(and |main_#t~short10| (= (+ main_~i~0 1) 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2163#(and (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (= main_~i~0 0))} is VALID [2022-04-08 03:35:11,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {2163#(and (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (= main_~i~0 0))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {2167#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-08 03:35:11,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {2167#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} #t~short10 := ~i~0 >= 0; {2171#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-08 03:35:11,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {2171#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume !#t~short10; {2175#(and (< main_~i~0 0) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-08 03:35:11,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {2175#(and (< main_~i~0 0) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2175#(and (< main_~i~0 0) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-08 03:35:11,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {2175#(and (< main_~i~0 0) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2182#(exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1))))} is VALID [2022-04-08 03:35:11,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {2182#(exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2182#(exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1))))} is VALID [2022-04-08 03:35:11,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {2182#(exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2182#(exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1))))} is VALID [2022-04-08 03:35:11,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {2182#(exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1))))} ~k~0 := 1; {2192#(and (= main_~k~0 1) (exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))))} is VALID [2022-04-08 03:35:11,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {2192#(and (= main_~k~0 1) (exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {2111#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-08 03:35:11,816 INFO L272 TraceCheckUtils]: 24: Hoare triple {2111#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2199#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:11,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {2199#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2203#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:11,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {2203#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2096#false} is VALID [2022-04-08 03:35:11,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {2096#false} assume !false; {2096#false} is VALID [2022-04-08 03:35:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 03:35:11,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:12,930 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 69 treesize of output 61 [2022-04-08 03:35:13,021 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-04-08 03:35:13,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 383 treesize of output 347 [2022-04-08 03:35:14,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {2096#false} assume !false; {2096#false} is VALID [2022-04-08 03:35:14,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {2203#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2096#false} is VALID [2022-04-08 03:35:14,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {2199#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2203#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:14,140 INFO L272 TraceCheckUtils]: 24: Hoare triple {2219#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2199#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:14,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {2223#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {2219#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:35:14,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {2227#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} ~k~0 := 1; {2223#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-08 03:35:14,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {2227#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2227#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:35:14,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {2227#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2227#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:35:14,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {2237#(forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2227#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:35:14,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {2237#(forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4)))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2237#(forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-08 03:35:14,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {2244#(or (forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10; {2237#(forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-08 03:35:14,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {2248#(or (<= 0 main_~i~0) (forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4))))))} #t~short10 := ~i~0 >= 0; {2244#(or (forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-08 03:35:14,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {2252#(or (forall ((v_main_~i~0_12 Int) (v_ArrVal_72 Int) (v_ArrVal_73 Int)) (or (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_72)) (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| (* v_main_~i~0_12 4) 4) v_ArrVal_73) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| (* v_main_~i~0_12 4) 4) v_ArrVal_73) (+ |main_~#v~0.offset| 4))) (not (<= main_~i~0 (+ v_main_~i~0_12 1))) (<= 0 v_main_~i~0_12))) (not |main_#t~short10|))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {2248#(or (<= 0 main_~i~0) (forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4))))))} is VALID [2022-04-08 03:35:14,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {2256#(or (not |main_#t~short10|) (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2252#(or (forall ((v_main_~i~0_12 Int) (v_ArrVal_72 Int) (v_ArrVal_73 Int)) (or (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_72)) (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| (* v_main_~i~0_12 4) 4) v_ArrVal_73) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| (* v_main_~i~0_12 4) 4) v_ArrVal_73) (+ |main_~#v~0.offset| 4))) (not (<= main_~i~0 (+ v_main_~i~0_12 1))) (<= 0 v_main_~i~0_12))) (not |main_#t~short10|))} is VALID [2022-04-08 03:35:14,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {2095#true} #t~short10 := ~i~0 >= 0; {2256#(or (not |main_#t~short10|) (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:35:14,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {2095#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2095#true} is VALID [2022-04-08 03:35:14,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {2095#true} ~j~0 := 1; {2095#true} is VALID [2022-04-08 03:35:14,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {2095#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2095#true} is VALID [2022-04-08 03:35:14,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {2095#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2095#true} is VALID [2022-04-08 03:35:14,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {2095#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2095#true} is VALID [2022-04-08 03:35:14,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {2095#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2095#true} is VALID [2022-04-08 03:35:14,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {2095#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2095#true} is VALID [2022-04-08 03:35:14,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {2095#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2095#true} is VALID [2022-04-08 03:35:14,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {2095#true} call #t~ret15 := main(); {2095#true} is VALID [2022-04-08 03:35:14,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2095#true} {2095#true} #87#return; {2095#true} is VALID [2022-04-08 03:35:14,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {2095#true} assume true; {2095#true} is VALID [2022-04-08 03:35:14,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {2095#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(19, 2);call #Ultimate.allocInit(12, 3); {2095#true} is VALID [2022-04-08 03:35:14,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {2095#true} call ULTIMATE.init(); {2095#true} is VALID [2022-04-08 03:35:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 03:35:14,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85082354] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:14,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:14,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 12] total 36 [2022-04-08 03:35:14,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:14,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2029707075] [2022-04-08 03:35:14,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2029707075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:14,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:14,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 03:35:14,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817692394] [2022-04-08 03:35:14,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:14,173 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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 28 [2022-04-08 03:35:14,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:14,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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:14,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:14,205 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 03:35:14,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:14,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 03:35:14,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1123, Unknown=1, NotChecked=0, Total=1260 [2022-04-08 03:35:14,206 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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:15,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:15,889 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2022-04-08 03:35:15,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 03:35:15,890 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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 28 [2022-04-08 03:35:15,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 103 transitions. [2022-04-08 03:35:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 103 transitions. [2022-04-08 03:35:15,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 103 transitions. [2022-04-08 03:35:15,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:15,997 INFO L225 Difference]: With dead ends: 104 [2022-04-08 03:35:15,997 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 03:35:15,998 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=338, Invalid=2417, Unknown=1, NotChecked=0, Total=2756 [2022-04-08 03:35:15,998 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 103 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:15,998 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 03:35:15,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 03:35:16,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2022-04-08 03:35:16,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:16,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:16,070 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:16,070 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:16,076 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-04-08 03:35:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2022-04-08 03:35:16,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:16,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:16,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 73 states. [2022-04-08 03:35:16,077 INFO L87 Difference]: Start difference. First operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 73 states. [2022-04-08 03:35:16,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:16,079 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-04-08 03:35:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2022-04-08 03:35:16,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:16,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:16,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:16,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-04-08 03:35:16,081 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 28 [2022-04-08 03:35:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:16,081 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-04-08 03:35:16,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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:16,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 52 transitions. [2022-04-08 03:35:16,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:16,161 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-04-08 03:35:16,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 03:35:16,161 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:16,161 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:16,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:16,361 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:16,361 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:16,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:16,362 INFO L85 PathProgramCache]: Analyzing trace with hash -990333180, now seen corresponding path program 5 times [2022-04-08 03:35:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:16,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1535678140] [2022-04-08 03:35:16,367 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:16,367 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:16,367 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:16,367 INFO L85 PathProgramCache]: Analyzing trace with hash -990333180, now seen corresponding path program 6 times [2022-04-08 03:35:16,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:16,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287410168] [2022-04-08 03:35:16,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:16,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:16,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:16,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {2792#(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(19, 2);call #Ultimate.allocInit(12, 3); {2781#true} is VALID [2022-04-08 03:35:16,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-08 03:35:16,505 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2781#true} {2781#true} #87#return; {2781#true} is VALID [2022-04-08 03:35:16,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {2781#true} call ULTIMATE.init(); {2792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:16,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {2792#(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(19, 2);call #Ultimate.allocInit(12, 3); {2781#true} is VALID [2022-04-08 03:35:16,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-08 03:35:16,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2781#true} {2781#true} #87#return; {2781#true} is VALID [2022-04-08 03:35:16,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {2781#true} call #t~ret15 := main(); {2781#true} is VALID [2022-04-08 03:35:16,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {2781#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2786#(= main_~j~0 0)} is VALID [2022-04-08 03:35:16,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {2786#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2786#(= main_~j~0 0)} is VALID [2022-04-08 03:35:16,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {2786#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:16,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:16,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2788#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:35:16,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {2788#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:16,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:16,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:16,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~short10 := ~i~0 >= 0; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:16,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:16,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:16,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:16,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2791#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:16,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {2791#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2782#false} is VALID [2022-04-08 03:35:16,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {2782#false} #t~short10 := ~i~0 >= 0; {2782#false} is VALID [2022-04-08 03:35:16,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {2782#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2782#false} is VALID [2022-04-08 03:35:16,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {2782#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2782#false} is VALID [2022-04-08 03:35:16,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {2782#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2782#false} is VALID [2022-04-08 03:35:16,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {2782#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2782#false} is VALID [2022-04-08 03:35:16,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {2782#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2782#false} is VALID [2022-04-08 03:35:16,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {2782#false} ~k~0 := 1; {2782#false} is VALID [2022-04-08 03:35:16,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {2782#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {2782#false} is VALID [2022-04-08 03:35:16,512 INFO L272 TraceCheckUtils]: 27: Hoare triple {2782#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2782#false} is VALID [2022-04-08 03:35:16,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {2782#false} ~cond := #in~cond; {2782#false} is VALID [2022-04-08 03:35:16,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {2782#false} assume 0 == ~cond; {2782#false} is VALID [2022-04-08 03:35:16,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {2782#false} assume !false; {2782#false} is VALID [2022-04-08 03:35:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:16,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:16,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287410168] [2022-04-08 03:35:16,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287410168] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:16,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923265862] [2022-04-08 03:35:16,513 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:35:16,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:16,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:16,514 INFO L229 MonitoredProcess]: Starting monitored process 6 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:16,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 03:35:16,567 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 03:35:16,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:16,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 03:35:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:16,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:17,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {2781#true} call ULTIMATE.init(); {2781#true} is VALID [2022-04-08 03:35:17,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {2781#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(19, 2);call #Ultimate.allocInit(12, 3); {2781#true} is VALID [2022-04-08 03:35:17,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-08 03:35:17,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2781#true} {2781#true} #87#return; {2781#true} is VALID [2022-04-08 03:35:17,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {2781#true} call #t~ret15 := main(); {2781#true} is VALID [2022-04-08 03:35:17,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {2781#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2786#(= main_~j~0 0)} is VALID [2022-04-08 03:35:17,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {2786#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2786#(= main_~j~0 0)} is VALID [2022-04-08 03:35:17,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {2786#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:17,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:17,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2823#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-08 03:35:17,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {2823#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:17,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:17,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:17,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~short10 := ~i~0 >= 0; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:17,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:17,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:17,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:17,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2848#(and (= main_~j~0 2) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:17,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {2848#(and (= main_~j~0 2) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2782#false} is VALID [2022-04-08 03:35:17,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {2782#false} #t~short10 := ~i~0 >= 0; {2782#false} is VALID [2022-04-08 03:35:17,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {2782#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2782#false} is VALID [2022-04-08 03:35:17,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {2782#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2782#false} is VALID [2022-04-08 03:35:17,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {2782#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2782#false} is VALID [2022-04-08 03:35:17,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {2782#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2782#false} is VALID [2022-04-08 03:35:17,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {2782#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2782#false} is VALID [2022-04-08 03:35:17,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {2782#false} ~k~0 := 1; {2782#false} is VALID [2022-04-08 03:35:17,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {2782#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {2782#false} is VALID [2022-04-08 03:35:17,036 INFO L272 TraceCheckUtils]: 27: Hoare triple {2782#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2782#false} is VALID [2022-04-08 03:35:17,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {2782#false} ~cond := #in~cond; {2782#false} is VALID [2022-04-08 03:35:17,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {2782#false} assume 0 == ~cond; {2782#false} is VALID [2022-04-08 03:35:17,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {2782#false} assume !false; {2782#false} is VALID [2022-04-08 03:35:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:17,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:17,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {2782#false} assume !false; {2782#false} is VALID [2022-04-08 03:35:17,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {2782#false} assume 0 == ~cond; {2782#false} is VALID [2022-04-08 03:35:17,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {2782#false} ~cond := #in~cond; {2782#false} is VALID [2022-04-08 03:35:17,391 INFO L272 TraceCheckUtils]: 27: Hoare triple {2782#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2782#false} is VALID [2022-04-08 03:35:17,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {2782#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {2782#false} is VALID [2022-04-08 03:35:17,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {2782#false} ~k~0 := 1; {2782#false} is VALID [2022-04-08 03:35:17,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {2782#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2782#false} is VALID [2022-04-08 03:35:17,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {2782#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2782#false} is VALID [2022-04-08 03:35:17,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {2782#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2782#false} is VALID [2022-04-08 03:35:17,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {2782#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2782#false} is VALID [2022-04-08 03:35:17,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {2782#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2782#false} is VALID [2022-04-08 03:35:17,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {2782#false} #t~short10 := ~i~0 >= 0; {2782#false} is VALID [2022-04-08 03:35:17,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {2791#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2782#false} is VALID [2022-04-08 03:35:17,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2791#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:17,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:17,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:17,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:17,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~short10 := ~i~0 >= 0; {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:17,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:17,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 03:35:17,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {2949#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:17,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {2953#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2949#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} is VALID [2022-04-08 03:35:17,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {2953#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2953#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-08 03:35:17,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {2960#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2953#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-08 03:35:17,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {2960#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2960#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-08 03:35:17,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {2781#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2960#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-08 03:35:17,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {2781#true} call #t~ret15 := main(); {2781#true} is VALID [2022-04-08 03:35:17,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2781#true} {2781#true} #87#return; {2781#true} is VALID [2022-04-08 03:35:17,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-08 03:35:17,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {2781#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(19, 2);call #Ultimate.allocInit(12, 3); {2781#true} is VALID [2022-04-08 03:35:17,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {2781#true} call ULTIMATE.init(); {2781#true} is VALID [2022-04-08 03:35:17,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:17,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923265862] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:17,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:17,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-08 03:35:17,401 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:17,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1535678140] [2022-04-08 03:35:17,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1535678140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:17,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:17,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:35:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247172976] [2022-04-08 03:35:17,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:17,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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 31 [2022-04-08 03:35:17,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:17,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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:17,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:17,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 03:35:17,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:17,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 03:35:17,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-04-08 03:35:17,423 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:17,992 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2022-04-08 03:35:17,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:35:17,992 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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 31 [2022-04-08 03:35:17,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2022-04-08 03:35:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2022-04-08 03:35:17,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 91 transitions. [2022-04-08 03:35:18,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:18,067 INFO L225 Difference]: With dead ends: 86 [2022-04-08 03:35:18,067 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 03:35:18,067 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-04-08 03:35:18,068 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 118 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:18,068 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 44 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 03:35:18,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2022-04-08 03:35:18,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:18,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:18,208 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:18,209 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:18,210 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-08 03:35:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-08 03:35:18,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:18,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:18,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 69 states. [2022-04-08 03:35:18,217 INFO L87 Difference]: Start difference. First operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 69 states. [2022-04-08 03:35:18,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:18,218 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-08 03:35:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-08 03:35:18,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:18,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:18,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:18,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:18,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2022-04-08 03:35:18,220 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 31 [2022-04-08 03:35:18,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:18,220 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2022-04-08 03:35:18,220 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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:18,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 67 transitions. [2022-04-08 03:35:18,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:18,330 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-08 03:35:18,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 03:35:18,331 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:18,331 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:18,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:18,543 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:18,544 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:18,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:18,544 INFO L85 PathProgramCache]: Analyzing trace with hash -405243253, now seen corresponding path program 1 times [2022-04-08 03:35:18,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:18,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [562029485] [2022-04-08 03:35:18,547 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:18,547 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:18,548 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:18,548 INFO L85 PathProgramCache]: Analyzing trace with hash -405243253, now seen corresponding path program 2 times [2022-04-08 03:35:18,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:18,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708922741] [2022-04-08 03:35:18,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:18,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:18,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:18,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {3439#(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(19, 2);call #Ultimate.allocInit(12, 3); {3424#true} is VALID [2022-04-08 03:35:18,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-08 03:35:18,655 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3424#true} {3424#true} #87#return; {3424#true} is VALID [2022-04-08 03:35:18,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-08 03:35:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:18,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {3424#true} ~cond := #in~cond; {3424#true} is VALID [2022-04-08 03:35:18,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#true} assume !(0 == ~cond); {3424#true} is VALID [2022-04-08 03:35:18,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-08 03:35:18,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3424#true} {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #85#return; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:18,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {3424#true} call ULTIMATE.init(); {3439#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:18,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {3439#(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(19, 2);call #Ultimate.allocInit(12, 3); {3424#true} is VALID [2022-04-08 03:35:18,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-08 03:35:18,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3424#true} {3424#true} #87#return; {3424#true} is VALID [2022-04-08 03:35:18,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {3424#true} call #t~ret15 := main(); {3424#true} is VALID [2022-04-08 03:35:18,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {3424#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3429#(= main_~j~0 0)} is VALID [2022-04-08 03:35:18,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {3429#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3429#(= main_~j~0 0)} is VALID [2022-04-08 03:35:18,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {3429#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:18,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:18,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3431#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:35:18,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {3431#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:18,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:18,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:18,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~short10 := ~i~0 >= 0; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:18,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:18,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:18,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:18,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:18,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:18,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~k~0 := 1; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:18,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:18,666 INFO L272 TraceCheckUtils]: 21: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3424#true} is VALID [2022-04-08 03:35:18,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {3424#true} ~cond := #in~cond; {3424#true} is VALID [2022-04-08 03:35:18,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {3424#true} assume !(0 == ~cond); {3424#true} is VALID [2022-04-08 03:35:18,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-08 03:35:18,667 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3424#true} {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #85#return; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:18,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} havoc #t~mem13;havoc #t~mem14; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:18,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3438#(and (<= (div main_~k~0 4294967296) 0) (<= main_~SIZE~0 (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:18,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {3438#(and (<= (div main_~k~0 4294967296) 0) (<= main_~SIZE~0 (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3425#false} is VALID [2022-04-08 03:35:18,669 INFO L272 TraceCheckUtils]: 29: Hoare triple {3425#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3425#false} is VALID [2022-04-08 03:35:18,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {3425#false} ~cond := #in~cond; {3425#false} is VALID [2022-04-08 03:35:18,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {3425#false} assume 0 == ~cond; {3425#false} is VALID [2022-04-08 03:35:18,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {3425#false} assume !false; {3425#false} is VALID [2022-04-08 03:35:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 03:35:18,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:18,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708922741] [2022-04-08 03:35:18,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708922741] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:18,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830715122] [2022-04-08 03:35:18,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:18,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:18,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:18,671 INFO L229 MonitoredProcess]: Starting monitored process 7 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:18,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 03:35:18,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:18,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:18,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 03:35:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:18,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:19,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {3424#true} call ULTIMATE.init(); {3424#true} is VALID [2022-04-08 03:35:19,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#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(19, 2);call #Ultimate.allocInit(12, 3); {3424#true} is VALID [2022-04-08 03:35:19,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-08 03:35:19,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3424#true} {3424#true} #87#return; {3424#true} is VALID [2022-04-08 03:35:19,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {3424#true} call #t~ret15 := main(); {3424#true} is VALID [2022-04-08 03:35:19,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {3424#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3429#(= main_~j~0 0)} is VALID [2022-04-08 03:35:19,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {3429#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3429#(= main_~j~0 0)} is VALID [2022-04-08 03:35:19,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {3429#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:19,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:19,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3470#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-08 03:35:19,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {3470#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~short10 := ~i~0 >= 0; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~k~0 := 1; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:19,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:19,187 INFO L272 TraceCheckUtils]: 21: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3424#true} is VALID [2022-04-08 03:35:19,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {3424#true} ~cond := #in~cond; {3424#true} is VALID [2022-04-08 03:35:19,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {3424#true} assume !(0 == ~cond); {3424#true} is VALID [2022-04-08 03:35:19,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-08 03:35:19,188 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3424#true} {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #85#return; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:19,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} havoc #t~mem13;havoc #t~mem14; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:19,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3525#(and (= main_~k~0 2) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:35:19,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {3525#(and (= main_~k~0 2) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3425#false} is VALID [2022-04-08 03:35:19,189 INFO L272 TraceCheckUtils]: 29: Hoare triple {3425#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3425#false} is VALID [2022-04-08 03:35:19,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {3425#false} ~cond := #in~cond; {3425#false} is VALID [2022-04-08 03:35:19,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {3425#false} assume 0 == ~cond; {3425#false} is VALID [2022-04-08 03:35:19,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {3425#false} assume !false; {3425#false} is VALID [2022-04-08 03:35:19,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 03:35:19,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:19,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {3425#false} assume !false; {3425#false} is VALID [2022-04-08 03:35:19,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {3425#false} assume 0 == ~cond; {3425#false} is VALID [2022-04-08 03:35:19,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {3425#false} ~cond := #in~cond; {3425#false} is VALID [2022-04-08 03:35:19,567 INFO L272 TraceCheckUtils]: 29: Hoare triple {3425#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3425#false} is VALID [2022-04-08 03:35:19,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {3553#(not (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3425#false} is VALID [2022-04-08 03:35:19,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3553#(not (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:35:19,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} havoc #t~mem13;havoc #t~mem14; {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:35:19,570 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3424#true} {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} #85#return; {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:35:19,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-08 03:35:19,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {3424#true} assume !(0 == ~cond); {3424#true} is VALID [2022-04-08 03:35:19,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {3424#true} ~cond := #in~cond; {3424#true} is VALID [2022-04-08 03:35:19,570 INFO L272 TraceCheckUtils]: 21: Hoare triple {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3424#true} is VALID [2022-04-08 03:35:19,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:35:19,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~k~0 := 1; {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:35:19,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~short10 := ~i~0 >= 0; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {3609#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:35:19,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {3613#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3609#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} is VALID [2022-04-08 03:35:19,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {3613#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3613#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-08 03:35:19,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {3620#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3613#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-08 03:35:19,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {3620#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3620#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-08 03:35:19,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {3424#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3620#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-08 03:35:19,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {3424#true} call #t~ret15 := main(); {3424#true} is VALID [2022-04-08 03:35:19,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3424#true} {3424#true} #87#return; {3424#true} is VALID [2022-04-08 03:35:19,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-08 03:35:19,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#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(19, 2);call #Ultimate.allocInit(12, 3); {3424#true} is VALID [2022-04-08 03:35:19,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {3424#true} call ULTIMATE.init(); {3424#true} is VALID [2022-04-08 03:35:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 03:35:19,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830715122] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:19,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:19,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-08 03:35:19,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:19,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [562029485] [2022-04-08 03:35:19,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [562029485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:19,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:19,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:35:19,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97228096] [2022-04-08 03:35:19,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:19,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-04-08 03:35:19,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:19,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:19,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:19,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 03:35:19,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:19,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 03:35:19,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 03:35:19,602 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:20,197 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2022-04-08 03:35:20,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 03:35:20,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-04-08 03:35:20,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-08 03:35:20,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-08 03:35:20,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2022-04-08 03:35:20,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:20,265 INFO L225 Difference]: With dead ends: 78 [2022-04-08 03:35:20,265 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 03:35:20,265 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2022-04-08 03:35:20,265 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 103 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:20,266 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 43 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 03:35:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-04-08 03:35:20,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:20,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:20,339 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:20,339 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:20,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:20,340 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-08 03:35:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-08 03:35:20,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:20,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:20,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 47 states. [2022-04-08 03:35:20,341 INFO L87 Difference]: Start difference. First operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 47 states. [2022-04-08 03:35:20,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:20,341 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-08 03:35:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-08 03:35:20,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:20,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:20,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:20,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-04-08 03:35:20,342 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 33 [2022-04-08 03:35:20,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:20,342 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-04-08 03:35:20,342 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:35:20,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 46 transitions. [2022-04-08 03:35:20,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-08 03:35:20,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 03:35:20,416 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:20,416 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:20,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:20,616 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:20,617 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:20,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1306424002, now seen corresponding path program 7 times [2022-04-08 03:35:20,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:20,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1878236153] [2022-04-08 03:35:20,620 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:20,620 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:20,621 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:20,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1306424002, now seen corresponding path program 8 times [2022-04-08 03:35:20,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:20,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305130643] [2022-04-08 03:35:20,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:20,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:21,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:21,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {4011#(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(19, 2);call #Ultimate.allocInit(12, 3); {3990#true} is VALID [2022-04-08 03:35:21,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-08 03:35:21,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3990#true} {3990#true} #87#return; {3990#true} is VALID [2022-04-08 03:35:21,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {3990#true} call ULTIMATE.init(); {4011#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:21,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {4011#(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(19, 2);call #Ultimate.allocInit(12, 3); {3990#true} is VALID [2022-04-08 03:35:21,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-08 03:35:21,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3990#true} {3990#true} #87#return; {3990#true} is VALID [2022-04-08 03:35:21,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {3990#true} call #t~ret15 := main(); {3990#true} is VALID [2022-04-08 03:35:21,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {3990#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3995#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-08 03:35:21,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {3995#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3995#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-08 03:35:21,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {3995#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3996#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:21,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {3996#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3996#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:21,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {3996#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3997#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| (* main_~j~0 4)) 0)))} is VALID [2022-04-08 03:35:21,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {3997#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| (* main_~j~0 4)) 0)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:21,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {3998#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:21,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {3998#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:21,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {3998#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {3996#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:21,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {3996#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {3999#(and (or (<= (+ main_~i~0 1) 0) (and (= |main_~#v~0.offset| 0) (<= (+ main_~i~0 1) main_~j~0))) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-08 03:35:21,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {3999#(and (or (<= (+ main_~i~0 1) 0) (and (= |main_~#v~0.offset| 0) (<= (+ main_~i~0 1) main_~j~0))) (= (+ (- 1) main_~j~0) 0))} #t~short10 := ~i~0 >= 0; {4000#(or (and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0)) (not |main_#t~short10|))} is VALID [2022-04-08 03:35:21,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {4000#(or (and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0)) (not |main_#t~short10|))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4001#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-08 03:35:21,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {4001#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4002#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-08 03:35:21,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {4002#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4003#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {4003#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4004#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {4004#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4005#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {4005#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {4005#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {4005#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4005#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {4005#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4005#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {4005#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4006#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {4006#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4006#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {4006#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4006#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {4006#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {4007#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-08 03:35:21,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {4007#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {4008#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:35:21,108 INFO L272 TraceCheckUtils]: 29: Hoare triple {4008#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4009#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:35:21,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {4009#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4010#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:35:21,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {4010#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3991#false} is VALID [2022-04-08 03:35:21,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {3991#false} assume !false; {3991#false} is VALID [2022-04-08 03:35:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:21,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:21,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305130643] [2022-04-08 03:35:21,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305130643] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:21,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103677803] [2022-04-08 03:35:21,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:21,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:21,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:21,110 INFO L229 MonitoredProcess]: Starting monitored process 8 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:21,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 03:35:21,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:21,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:21,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 03:35:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:21,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:21,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:35:21,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 27 [2022-04-08 03:35:21,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:35:21,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:35:21,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:35:21,639 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-08 03:35:21,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-04-08 03:35:21,709 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-08 03:35:21,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-04-08 03:35:21,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {3990#true} call ULTIMATE.init(); {3990#true} is VALID [2022-04-08 03:35:21,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {3990#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(19, 2);call #Ultimate.allocInit(12, 3); {3990#true} is VALID [2022-04-08 03:35:21,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-08 03:35:21,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3990#true} {3990#true} #87#return; {3990#true} is VALID [2022-04-08 03:35:21,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {3990#true} call #t~ret15 := main(); {3990#true} is VALID [2022-04-08 03:35:21,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {3990#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:21,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {3998#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:21,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {3998#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:21,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {3998#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:21,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {3998#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:21,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {3998#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:21,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {3998#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:21,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {3998#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:21,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {3998#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {3996#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:21,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {3996#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4057#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:21,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {4057#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {4061#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1) |main_#t~short10|)} is VALID [2022-04-08 03:35:21,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {4061#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1) |main_#t~short10|)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4001#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-08 03:35:21,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {4001#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4002#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-08 03:35:21,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {4002#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4003#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {4003#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4004#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {4004#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4006#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {4006#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4006#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {4006#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4006#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:21,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {4006#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {4007#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-08 03:35:21,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {4007#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {4008#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:35:21,820 INFO L272 TraceCheckUtils]: 29: Hoare triple {4008#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4105#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:21,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {4105#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4109#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:21,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {4109#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3991#false} is VALID [2022-04-08 03:35:21,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {3991#false} assume !false; {3991#false} is VALID [2022-04-08 03:35:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:35:21,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:40,290 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 57 treesize of output 51 [2022-04-08 03:35:40,369 INFO L356 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-04-08 03:35:40,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1429 treesize of output 1347 [2022-04-08 03:35:47,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {3991#false} assume !false; {3991#false} is VALID [2022-04-08 03:35:47,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {4109#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3991#false} is VALID [2022-04-08 03:35:47,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {4105#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4109#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:47,898 INFO L272 TraceCheckUtils]: 29: Hoare triple {4008#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4105#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:47,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {4128#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {4008#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:35:47,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {4132#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} ~k~0 := 1; {4128#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-08 03:35:47,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {4132#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4132#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:35:47,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {4132#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4132#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:35:47,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4132#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:35:47,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:47,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:47,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:47,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {4155#(forall ((v_main_~i~0_18 Int)) (or (forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4)))) (not (<= main_~j~0 (+ v_main_~i~0_18 1)))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:47,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {4159#(forall ((v_ArrVal_137 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (< v_main_~i~0_18 main_~j~0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4155#(forall ((v_main_~i~0_18 Int)) (or (forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4)))) (not (<= main_~j~0 (+ v_main_~i~0_18 1)))))} is VALID [2022-04-08 03:35:47,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {4163#(forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_135)) (< v_main_~i~0_18 main_~j~0)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4159#(forall ((v_ArrVal_137 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (< v_main_~i~0_18 main_~j~0)))} is VALID [2022-04-08 03:35:47,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {4167#(or (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_135)) (< v_main_~i~0_18 main_~j~0))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4163#(forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_135)) (< v_main_~i~0_18 main_~j~0)))} is VALID [2022-04-08 03:35:47,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {4171#(or (not |main_#t~short10|) (and (< 0 main_~j~0) (= 0 (* main_~i~0 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4167#(or (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_135)) (< v_main_~i~0_18 main_~j~0))) |main_#t~short10|)} is VALID [2022-04-08 03:35:47,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {4175#(or (not (<= 0 main_~i~0)) (and (< 0 main_~j~0) (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {4171#(or (not |main_#t~short10|) (and (< 0 main_~j~0) (= 0 (* main_~i~0 4))))} is VALID [2022-04-08 03:35:47,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {4179#(or (not (<= 1 main_~j~0)) (= (* main_~j~0 4) 4))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4175#(or (not (<= 0 main_~i~0)) (and (< 0 main_~j~0) (= 0 (* main_~i~0 4))))} is VALID [2022-04-08 03:35:47,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {3990#true} ~j~0 := 1; {4179#(or (not (<= 1 main_~j~0)) (= (* main_~j~0 4) 4))} is VALID [2022-04-08 03:35:47,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {3990#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3990#true} is VALID [2022-04-08 03:35:47,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {3990#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3990#true} is VALID [2022-04-08 03:35:47,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {3990#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3990#true} is VALID [2022-04-08 03:35:47,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {3990#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3990#true} is VALID [2022-04-08 03:35:47,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {3990#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3990#true} is VALID [2022-04-08 03:35:47,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {3990#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3990#true} is VALID [2022-04-08 03:35:47,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {3990#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3990#true} is VALID [2022-04-08 03:35:47,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {3990#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3990#true} is VALID [2022-04-08 03:35:47,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {3990#true} call #t~ret15 := main(); {3990#true} is VALID [2022-04-08 03:35:47,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3990#true} {3990#true} #87#return; {3990#true} is VALID [2022-04-08 03:35:47,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-08 03:35:47,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {3990#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(19, 2);call #Ultimate.allocInit(12, 3); {3990#true} is VALID [2022-04-08 03:35:47,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {3990#true} call ULTIMATE.init(); {3990#true} is VALID [2022-04-08 03:35:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:35:47,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103677803] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:47,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:47,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 15] total 34 [2022-04-08 03:35:47,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:47,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1878236153] [2022-04-08 03:35:47,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1878236153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:47,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:47,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 03:35:47,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189380312] [2022-04-08 03:35:47,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:47,912 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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 33 [2022-04-08 03:35:47,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:47,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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:47,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:47,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 03:35:47,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:47,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 03:35:47,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=956, Unknown=17, NotChecked=0, Total=1122 [2022-04-08 03:35:47,946 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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:50,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:50,136 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-08 03:35:50,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 03:35:50,136 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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 33 [2022-04-08 03:35:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 139 transitions. [2022-04-08 03:35:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 139 transitions. [2022-04-08 03:35:50,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 139 transitions. [2022-04-08 03:35:50,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:50,301 INFO L225 Difference]: With dead ends: 118 [2022-04-08 03:35:50,301 INFO L226 Difference]: Without dead ends: 101 [2022-04-08 03:35:50,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=527, Invalid=2878, Unknown=17, NotChecked=0, Total=3422 [2022-04-08 03:35:50,303 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 162 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:50,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 61 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 03:35:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-08 03:35:50,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 65. [2022-04-08 03:35:50,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:50,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:50,465 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:50,465 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:50,467 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2022-04-08 03:35:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2022-04-08 03:35:50,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:50,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:50,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 101 states. [2022-04-08 03:35:50,468 INFO L87 Difference]: Start difference. First operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 101 states. [2022-04-08 03:35:50,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:50,471 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2022-04-08 03:35:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2022-04-08 03:35:50,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:50,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:50,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:50,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2022-04-08 03:35:50,472 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 33 [2022-04-08 03:35:50,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:50,472 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2022-04-08 03:35:50,473 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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:50,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 77 transitions. [2022-04-08 03:35:50,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-04-08 03:35:50,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 03:35:50,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:50,584 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:50,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:50,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:50,787 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:50,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash -350564349, now seen corresponding path program 1 times [2022-04-08 03:35:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:50,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [287557117] [2022-04-08 03:35:50,792 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:50,792 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:50,792 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:50,792 INFO L85 PathProgramCache]: Analyzing trace with hash -350564349, now seen corresponding path program 2 times [2022-04-08 03:35:50,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:50,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468444180] [2022-04-08 03:35:50,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:50,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:51,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:51,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {4860#(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(19, 2);call #Ultimate.allocInit(12, 3); {4842#true} is VALID [2022-04-08 03:35:51,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {4842#true} assume true; {4842#true} is VALID [2022-04-08 03:35:51,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4842#true} {4842#true} #87#return; {4842#true} is VALID [2022-04-08 03:35:51,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {4842#true} call ULTIMATE.init(); {4860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:51,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {4860#(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(19, 2);call #Ultimate.allocInit(12, 3); {4842#true} is VALID [2022-04-08 03:35:51,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {4842#true} assume true; {4842#true} is VALID [2022-04-08 03:35:51,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4842#true} {4842#true} #87#return; {4842#true} is VALID [2022-04-08 03:35:51,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {4842#true} call #t~ret15 := main(); {4842#true} is VALID [2022-04-08 03:35:51,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {4842#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {4847#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-08 03:35:51,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {4847#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4847#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-08 03:35:51,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {4847#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:51,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:51,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:51,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {4849#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:51,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {4849#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:51,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {4849#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:51,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {4849#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:51,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:51,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:51,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:51,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:51,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:51,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4850#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8))} is VALID [2022-04-08 03:35:51,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {4850#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4851#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:35:51,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {4851#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {4851#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:35:51,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {4851#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4851#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:35:51,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {4851#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {4852#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:35:51,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {4852#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {4852#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:35:51,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {4852#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4853#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-08 03:35:51,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {4853#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4854#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} is VALID [2022-04-08 03:35:51,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {4854#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4855#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:51,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {4855#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4855#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:51,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {4855#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4855#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:51,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {4855#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {4856#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-08 03:35:51,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {4856#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {4857#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:35:51,071 INFO L272 TraceCheckUtils]: 32: Hoare triple {4857#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4858#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:35:51,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {4858#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4859#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:35:51,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {4859#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4843#false} is VALID [2022-04-08 03:35:51,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {4843#false} assume !false; {4843#false} is VALID [2022-04-08 03:35:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 03:35:51,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:51,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468444180] [2022-04-08 03:35:51,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468444180] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:51,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592299664] [2022-04-08 03:35:51,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:51,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:51,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:51,073 INFO L229 MonitoredProcess]: Starting monitored process 9 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:51,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 03:35:51,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:51,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:51,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 03:35:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:51,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:51,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:35:51,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 27 [2022-04-08 03:35:51,610 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-08 03:35:51,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-04-08 03:35:51,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {4842#true} call ULTIMATE.init(); {4842#true} is VALID [2022-04-08 03:35:51,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {4842#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(19, 2);call #Ultimate.allocInit(12, 3); {4842#true} is VALID [2022-04-08 03:35:51,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {4842#true} assume true; {4842#true} is VALID [2022-04-08 03:35:51,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4842#true} {4842#true} #87#return; {4842#true} is VALID [2022-04-08 03:35:51,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {4842#true} call #t~ret15 := main(); {4842#true} is VALID [2022-04-08 03:35:51,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {4842#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:51,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {4849#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:51,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {4849#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:51,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {4849#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:51,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {4849#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:51,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {4849#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:51,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {4849#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:51,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {4849#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:51,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {4849#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:51,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:51,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:51,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:51,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:51,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:51,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4922#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2))} is VALID [2022-04-08 03:35:51,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {4922#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-08 03:35:51,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} #t~short10 := ~i~0 >= 0; {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-08 03:35:51,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-08 03:35:51,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {4936#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} is VALID [2022-04-08 03:35:51,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {4936#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} #t~short10 := ~i~0 >= 0; {4940#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-08 03:35:51,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {4940#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4853#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-08 03:35:51,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {4853#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4854#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} is VALID [2022-04-08 03:35:51,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {4854#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4855#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:51,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {4855#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4855#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:51,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {4855#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4855#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:51,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {4855#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {4856#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-08 03:35:51,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {4856#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {4857#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:35:51,690 INFO L272 TraceCheckUtils]: 32: Hoare triple {4857#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4965#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:51,691 INFO L290 TraceCheckUtils]: 33: Hoare triple {4965#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4969#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:51,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {4969#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4843#false} is VALID [2022-04-08 03:35:51,691 INFO L290 TraceCheckUtils]: 35: Hoare triple {4843#false} assume !false; {4843#false} is VALID [2022-04-08 03:35:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:35:51,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:52,017 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 41 treesize of output 35 [2022-04-08 03:35:52,044 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-04-08 03:35:52,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 90 [2022-04-08 03:35:52,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {4843#false} assume !false; {4843#false} is VALID [2022-04-08 03:35:52,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {4969#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4843#false} is VALID [2022-04-08 03:35:52,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {4965#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4969#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:52,310 INFO L272 TraceCheckUtils]: 32: Hoare triple {4857#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4965#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:52,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {4988#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {4857#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:35:52,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {4992#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} ~k~0 := 1; {4988#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-08 03:35:52,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {4992#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4992#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:35:52,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {4992#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4992#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:35:52,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {5002#(forall ((v_ArrVal_167 Int)) (or (not (<= main_~key~0 v_ArrVal_167)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4992#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:35:52,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {5006#(or (forall ((v_ArrVal_167 Int)) (or (not (<= main_~key~0 v_ArrVal_167)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5002#(forall ((v_ArrVal_167 Int)) (or (not (<= main_~key~0 v_ArrVal_167)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-08 03:35:52,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {5010#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5006#(or (forall ((v_ArrVal_167 Int)) (or (not (<= main_~key~0 v_ArrVal_167)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-08 03:35:52,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {5014#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {5010#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:35:52,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {5018#(<= main_~i~0 1)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {5014#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:35:52,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {5018#(<= main_~i~0 1)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5018#(<= main_~i~0 1)} is VALID [2022-04-08 03:35:52,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {5018#(<= main_~i~0 1)} #t~short10 := ~i~0 >= 0; {5018#(<= main_~i~0 1)} is VALID [2022-04-08 03:35:52,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {5028#(<= main_~j~0 2)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5018#(<= main_~i~0 1)} is VALID [2022-04-08 03:35:52,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {5032#(<= main_~j~0 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5028#(<= main_~j~0 2)} is VALID [2022-04-08 03:35:52,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {5032#(<= main_~j~0 1)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5032#(<= main_~j~0 1)} is VALID [2022-04-08 03:35:52,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {5032#(<= main_~j~0 1)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5032#(<= main_~j~0 1)} is VALID [2022-04-08 03:35:52,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {5032#(<= main_~j~0 1)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5032#(<= main_~j~0 1)} is VALID [2022-04-08 03:35:52,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {5032#(<= main_~j~0 1)} #t~short10 := ~i~0 >= 0; {5032#(<= main_~j~0 1)} is VALID [2022-04-08 03:35:52,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {5032#(<= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5032#(<= main_~j~0 1)} is VALID [2022-04-08 03:35:52,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {4842#true} ~j~0 := 1; {5032#(<= main_~j~0 1)} is VALID [2022-04-08 03:35:52,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {4842#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4842#true} is VALID [2022-04-08 03:35:52,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {4842#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4842#true} is VALID [2022-04-08 03:35:52,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {4842#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4842#true} is VALID [2022-04-08 03:35:52,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {4842#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4842#true} is VALID [2022-04-08 03:35:52,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {4842#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4842#true} is VALID [2022-04-08 03:35:52,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {4842#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4842#true} is VALID [2022-04-08 03:35:52,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {4842#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4842#true} is VALID [2022-04-08 03:35:52,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {4842#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {4842#true} is VALID [2022-04-08 03:35:52,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {4842#true} call #t~ret15 := main(); {4842#true} is VALID [2022-04-08 03:35:52,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4842#true} {4842#true} #87#return; {4842#true} is VALID [2022-04-08 03:35:52,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {4842#true} assume true; {4842#true} is VALID [2022-04-08 03:35:52,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {4842#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(19, 2);call #Ultimate.allocInit(12, 3); {4842#true} is VALID [2022-04-08 03:35:52,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {4842#true} call ULTIMATE.init(); {4842#true} is VALID [2022-04-08 03:35:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:35:52,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592299664] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:52,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:52,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 32 [2022-04-08 03:35:52,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:52,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [287557117] [2022-04-08 03:35:52,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [287557117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:52,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:52,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 03:35:52,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759242813] [2022-04-08 03:35:52,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:52,322 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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 36 [2022-04-08 03:35:52,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:52,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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:52,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:52,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 03:35:52,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:52,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 03:35:52,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2022-04-08 03:35:52,350 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:54,613 INFO L93 Difference]: Finished difference Result 164 states and 211 transitions. [2022-04-08 03:35:54,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 03:35:54,613 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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 36 [2022-04-08 03:35:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 138 transitions. [2022-04-08 03:35:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 138 transitions. [2022-04-08 03:35:54,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 138 transitions. [2022-04-08 03:35:54,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:54,737 INFO L225 Difference]: With dead ends: 164 [2022-04-08 03:35:54,737 INFO L226 Difference]: Without dead ends: 162 [2022-04-08 03:35:54,738 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=580, Invalid=3080, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 03:35:54,738 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 171 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:54,738 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 75 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 03:35:54,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-08 03:35:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 84. [2022-04-08 03:35:54,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:54,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:54,968 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:54,968 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:54,973 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2022-04-08 03:35:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 209 transitions. [2022-04-08 03:35:54,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:54,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:54,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 162 states. [2022-04-08 03:35:54,974 INFO L87 Difference]: Start difference. First operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 162 states. [2022-04-08 03:35:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:54,976 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2022-04-08 03:35:54,976 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 209 transitions. [2022-04-08 03:35:54,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:54,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:54,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:54,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2022-04-08 03:35:54,980 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 36 [2022-04-08 03:35:54,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:54,981 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2022-04-08 03:35:54,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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:54,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 107 transitions. [2022-04-08 03:35:55,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:55,140 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2022-04-08 03:35:55,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 03:35:55,140 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:55,140 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:55,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:55,341 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 03:35:55,341 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:55,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1169352267, now seen corresponding path program 3 times [2022-04-08 03:35:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:55,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [526713912] [2022-04-08 03:35:55,345 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:55,345 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:55,345 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:55,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1169352267, now seen corresponding path program 4 times [2022-04-08 03:35:55,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:55,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821713429] [2022-04-08 03:35:55,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:55,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:55,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:55,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {5993#(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(19, 2);call #Ultimate.allocInit(12, 3); {5970#true} is VALID [2022-04-08 03:35:55,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {5970#true} assume true; {5970#true} is VALID [2022-04-08 03:35:55,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5970#true} {5970#true} #87#return; {5970#true} is VALID [2022-04-08 03:35:55,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {5970#true} call ULTIMATE.init(); {5993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:55,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {5993#(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(19, 2);call #Ultimate.allocInit(12, 3); {5970#true} is VALID [2022-04-08 03:35:55,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {5970#true} assume true; {5970#true} is VALID [2022-04-08 03:35:55,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5970#true} {5970#true} #87#return; {5970#true} is VALID [2022-04-08 03:35:55,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {5970#true} call #t~ret15 := main(); {5970#true} is VALID [2022-04-08 03:35:55,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {5970#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {5975#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-08 03:35:55,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {5975#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5975#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-08 03:35:55,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {5975#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:55,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:55,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5977#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-08 03:35:55,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {5977#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5977#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-08 03:35:55,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {5977#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:55,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {5978#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:55,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {5978#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:55,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5979#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-08 03:35:55,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {5979#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {5980#(and (= (+ (- 1) main_~j~0) 0) (or (and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4))) (not |main_#t~short10|)))} is VALID [2022-04-08 03:35:55,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {5980#(and (= (+ (- 1) main_~j~0) 0) (or (and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4))) (not |main_#t~short10|)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5981#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:35:55,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {5981#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 0 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {5982#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 main_~i~0)) (not (= 0 (* main_~i~0 4))))} is VALID [2022-04-08 03:35:55,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {5982#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 main_~i~0)) (not (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {5983#(and (= |main_~#v~0.offset| 0) (or (and (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))) |main_#t~short10|) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-08 03:35:55,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {5983#(and (= |main_~#v~0.offset| 0) (or (and (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))) |main_#t~short10|) (= (+ (- 1) main_~j~0) 0))} assume !#t~short10; {5984#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:55,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {5984#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5984#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:55,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {5984#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5985#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:55,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {5985#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5986#(and (= |main_~#v~0.offset| 0) (<= 2 main_~j~0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:55,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {5986#(and (= |main_~#v~0.offset| 0) (<= 2 main_~j~0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5987#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} is VALID [2022-04-08 03:35:55,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {5987#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} #t~short10 := ~i~0 >= 0; {5987#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} is VALID [2022-04-08 03:35:55,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {5987#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5987#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} is VALID [2022-04-08 03:35:55,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {5987#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5987#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} is VALID [2022-04-08 03:35:55,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {5987#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5988#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:55,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {5988#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5988#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:55,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {5988#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5988#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:55,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {5988#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {5989#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-08 03:35:55,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {5989#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {5990#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-08 03:35:55,866 INFO L272 TraceCheckUtils]: 32: Hoare triple {5990#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {5991#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:35:55,866 INFO L290 TraceCheckUtils]: 33: Hoare triple {5991#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5992#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:35:55,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {5992#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5971#false} is VALID [2022-04-08 03:35:55,866 INFO L290 TraceCheckUtils]: 35: Hoare triple {5971#false} assume !false; {5971#false} is VALID [2022-04-08 03:35:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:55,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:55,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821713429] [2022-04-08 03:35:55,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821713429] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:55,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909684804] [2022-04-08 03:35:55,867 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:35:55,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:55,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:55,868 INFO L229 MonitoredProcess]: Starting monitored process 10 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:55,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 03:35:55,931 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:35:55,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:55,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 03:35:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:55,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:56,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:35:56,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 30 [2022-04-08 03:35:56,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:35:56,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 03:35:56,913 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-08 03:35:56,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2022-04-08 03:35:57,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:35:57,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:35:57,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:35:57,193 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-08 03:35:57,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-04-08 03:35:57,262 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-08 03:35:57,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2022-04-08 03:35:57,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {5970#true} call ULTIMATE.init(); {5970#true} is VALID [2022-04-08 03:35:57,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {5970#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(19, 2);call #Ultimate.allocInit(12, 3); {5970#true} is VALID [2022-04-08 03:35:57,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {5970#true} assume true; {5970#true} is VALID [2022-04-08 03:35:57,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5970#true} {5970#true} #87#return; {5970#true} is VALID [2022-04-08 03:35:57,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {5970#true} call #t~ret15 := main(); {5970#true} is VALID [2022-04-08 03:35:57,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {5970#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:57,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {5978#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:57,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {5978#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:57,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {5978#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:57,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {5978#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:57,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {5978#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:57,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {5978#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:57,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {5978#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:35:57,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {5978#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:57,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:57,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {6042#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-08 03:35:57,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {6042#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6046#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (<= 0 main_~i~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:35:57,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {6046#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (<= 0 main_~i~0) (<= main_~j~0 1))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {6050#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} is VALID [2022-04-08 03:35:57,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {6050#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} #t~short10 := ~i~0 >= 0; {6054#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-08 03:35:57,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {6054#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume !#t~short10; {6058#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} is VALID [2022-04-08 03:35:57,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {6058#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6058#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} is VALID [2022-04-08 03:35:57,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {6058#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5985#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:57,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {5985#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6068#(and (= |main_~#v~0.offset| 0) (= main_~j~0 2) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:57,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {6068#(and (= |main_~#v~0.offset| 0) (= main_~j~0 2) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6072#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:57,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {6072#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {6072#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:57,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {6072#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6072#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:57,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {6072#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6072#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:57,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {6072#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5988#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:57,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {5988#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5988#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:57,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {5988#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5988#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:35:57,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {5988#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {5989#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-08 03:35:57,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {5989#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {5990#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-08 03:35:57,367 INFO L272 TraceCheckUtils]: 32: Hoare triple {5990#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {6100#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:57,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {6100#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6104#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:57,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {6104#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5971#false} is VALID [2022-04-08 03:35:57,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {5971#false} assume !false; {5971#false} is VALID [2022-04-08 03:35:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:35:57,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:36:04,974 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 85 treesize of output 77 [2022-04-08 03:36:05,116 INFO L356 Elim1Store]: treesize reduction 27, result has 27.0 percent of original size [2022-04-08 03:36:05,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5429 treesize of output 5235 [2022-04-08 03:37:44,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {5971#false} assume !false; {5971#false} is VALID [2022-04-08 03:37:44,090 INFO L290 TraceCheckUtils]: 34: Hoare triple {6104#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5971#false} is VALID [2022-04-08 03:37:44,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {6100#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6104#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:37:44,091 INFO L272 TraceCheckUtils]: 32: Hoare triple {6120#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {6100#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:37:44,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {6124#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {6120#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:37:44,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {6128#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} ~k~0 := 1; {6124#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-08 03:37:44,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {6128#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6128#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:37:44,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {6128#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6128#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:37:44,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {6138#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6128#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:37:44,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {6138#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6138#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:37:44,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {6138#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6138#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:37:44,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {6138#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {6138#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:37:44,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {6151#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6138#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:37:44,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {6155#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6151#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:37:44,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {6159#(forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int)) (or (not (<= v_ArrVal_200 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6155#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:37:44,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {6159#(forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int)) (or (not (<= v_ArrVal_200 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4)))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6159#(forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int)) (or (not (<= v_ArrVal_200 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-08 03:37:44,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {6166#(or (forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int)) (or (not (<= v_ArrVal_200 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10; {6159#(forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int)) (or (not (<= v_ArrVal_200 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-08 03:37:44,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {6170#(or (forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int)) (or (not (<= v_ArrVal_200 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))) (<= 0 main_~i~0))} #t~short10 := ~i~0 >= 0; {6166#(or (forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int)) (or (not (<= v_ArrVal_200 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-08 03:37:44,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {6174#(or (not |main_#t~short10|) (forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int) (v_ArrVal_198 Int) (v_main_~i~0_26 Int)) (or (<= (select (store (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_198) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |main_~#v~0.offset|) (select (store (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_198) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4))) (<= 0 v_main_~i~0_26) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_198)) (not (<= v_ArrVal_200 main_~key~0)) (not (<= main_~i~0 (+ v_main_~i~0_26 1))))))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {6170#(or (forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int)) (or (not (<= v_ArrVal_200 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))) (<= 0 main_~i~0))} is VALID [2022-04-08 03:37:44,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {6178#(or (not |main_#t~short10|) (and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)) (= 0 (* main_~i~0 4))) (<= 1 main_~i~0))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6174#(or (not |main_#t~short10|) (forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int) (v_ArrVal_198 Int) (v_main_~i~0_26 Int)) (or (<= (select (store (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_198) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |main_~#v~0.offset|) (select (store (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_198) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4))) (<= 0 v_main_~i~0_26) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_198)) (not (<= v_ArrVal_200 main_~key~0)) (not (<= main_~i~0 (+ v_main_~i~0_26 1))))))} is VALID [2022-04-08 03:37:44,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {6182#(and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)))} #t~short10 := ~i~0 >= 0; {6178#(or (not |main_#t~short10|) (and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)) (= 0 (* main_~i~0 4))) (<= 1 main_~i~0))} is VALID [2022-04-08 03:37:44,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {6182#(and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6182#(and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)))} is VALID [2022-04-08 03:37:44,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {5970#true} ~j~0 := 1; {6182#(and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)))} is VALID [2022-04-08 03:37:44,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {5970#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5970#true} is VALID [2022-04-08 03:37:44,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {5970#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5970#true} is VALID [2022-04-08 03:37:44,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {5970#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5970#true} is VALID [2022-04-08 03:37:44,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {5970#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5970#true} is VALID [2022-04-08 03:37:44,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {5970#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5970#true} is VALID [2022-04-08 03:37:44,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {5970#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5970#true} is VALID [2022-04-08 03:37:44,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {5970#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5970#true} is VALID [2022-04-08 03:37:44,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {5970#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {5970#true} is VALID [2022-04-08 03:37:44,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {5970#true} call #t~ret15 := main(); {5970#true} is VALID [2022-04-08 03:37:44,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5970#true} {5970#true} #87#return; {5970#true} is VALID [2022-04-08 03:37:44,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {5970#true} assume true; {5970#true} is VALID [2022-04-08 03:37:44,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {5970#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(19, 2);call #Ultimate.allocInit(12, 3); {5970#true} is VALID [2022-04-08 03:37:44,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {5970#true} call ULTIMATE.init(); {5970#true} is VALID [2022-04-08 03:37:44,111 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 1 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:37:44,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909684804] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:37:44,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:37:44,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 16] total 42 [2022-04-08 03:37:44,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:37:44,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [526713912] [2022-04-08 03:37:44,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [526713912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:37:44,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:37:44,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 03:37:44,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094812551] [2022-04-08 03:37:44,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:37:44,112 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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 36 [2022-04-08 03:37:44,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:37:44,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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:37:44,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:37:44,143 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 03:37:44,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:37:44,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 03:37:44,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1516, Unknown=7, NotChecked=0, Total=1722 [2022-04-08 03:37:44,144 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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:37:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:37:46,639 INFO L93 Difference]: Finished difference Result 134 states and 174 transitions. [2022-04-08 03:37:46,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 03:37:46,639 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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 36 [2022-04-08 03:37:46,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:37:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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:37:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 101 transitions. [2022-04-08 03:37:46,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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:37:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 101 transitions. [2022-04-08 03:37:46,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 101 transitions. [2022-04-08 03:37:46,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:37:46,734 INFO L225 Difference]: With dead ends: 134 [2022-04-08 03:37:46,735 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 03:37:46,735 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=429, Invalid=3104, Unknown=7, NotChecked=0, Total=3540 [2022-04-08 03:37:46,736 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 122 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 03:37:46,736 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 76 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 03:37:46,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 03:37:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 91. [2022-04-08 03:37:46,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:37:46,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 91 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 84 states have internal predecessors, (111), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:37:46,986 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 91 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 84 states have internal predecessors, (111), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:37:46,986 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 91 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 84 states have internal predecessors, (111), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:37:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:37:46,988 INFO L93 Difference]: Finished difference Result 132 states and 172 transitions. [2022-04-08 03:37:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 172 transitions. [2022-04-08 03:37:46,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:37:46,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:37:46,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 84 states have internal predecessors, (111), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 132 states. [2022-04-08 03:37:46,988 INFO L87 Difference]: Start difference. First operand has 91 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 84 states have internal predecessors, (111), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 132 states. [2022-04-08 03:37:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:37:46,995 INFO L93 Difference]: Finished difference Result 132 states and 172 transitions. [2022-04-08 03:37:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 172 transitions. [2022-04-08 03:37:46,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:37:46,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:37:46,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:37:46,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:37:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 84 states have internal predecessors, (111), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:37:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 118 transitions. [2022-04-08 03:37:46,997 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 118 transitions. Word has length 36 [2022-04-08 03:37:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:37:46,997 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 118 transitions. [2022-04-08 03:37:46,997 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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:37:46,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 118 transitions. [2022-04-08 03:37:47,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:37:47,206 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2022-04-08 03:37:47,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 03:37:47,206 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:37:47,206 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:37:47,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 03:37:47,418 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:37:47,418 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:37:47,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:37:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1631396062, now seen corresponding path program 3 times [2022-04-08 03:37:47,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:37:47,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [426168631] [2022-04-08 03:37:47,422 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:37:47,422 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:37:47,422 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:37:47,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1631396062, now seen corresponding path program 4 times [2022-04-08 03:37:47,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:37:47,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321688464] [2022-04-08 03:37:47,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:37:47,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:37:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:37:47,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:37:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:37:47,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {6991#(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(19, 2);call #Ultimate.allocInit(12, 3); {6980#true} is VALID [2022-04-08 03:37:47,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {6980#true} assume true; {6980#true} is VALID [2022-04-08 03:37:47,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6980#true} {6980#true} #87#return; {6980#true} is VALID [2022-04-08 03:37:47,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {6980#true} call ULTIMATE.init(); {6991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:37:47,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {6991#(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(19, 2);call #Ultimate.allocInit(12, 3); {6980#true} is VALID [2022-04-08 03:37:47,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {6980#true} assume true; {6980#true} is VALID [2022-04-08 03:37:47,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6980#true} {6980#true} #87#return; {6980#true} is VALID [2022-04-08 03:37:47,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {6980#true} call #t~ret15 := main(); {6980#true} is VALID [2022-04-08 03:37:47,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {6980#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {6980#true} is VALID [2022-04-08 03:37:47,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {6980#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6980#true} is VALID [2022-04-08 03:37:47,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {6980#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6980#true} is VALID [2022-04-08 03:37:47,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {6980#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6980#true} is VALID [2022-04-08 03:37:47,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {6980#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6980#true} is VALID [2022-04-08 03:37:47,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {6980#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6980#true} is VALID [2022-04-08 03:37:47,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {6980#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6980#true} is VALID [2022-04-08 03:37:47,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {6980#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6980#true} is VALID [2022-04-08 03:37:47,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {6980#true} ~j~0 := 1; {6985#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-08 03:37:47,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {6985#(= (+ (- 1) main_~j~0) 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6985#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-08 03:37:47,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {6985#(= (+ (- 1) main_~j~0) 0)} #t~short10 := ~i~0 >= 0; {6985#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-08 03:37:47,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {6985#(= (+ (- 1) main_~j~0) 0)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6985#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-08 03:37:47,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {6985#(= (+ (- 1) main_~j~0) 0)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6985#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-08 03:37:47,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {6985#(= (+ (- 1) main_~j~0) 0)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6985#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-08 03:37:47,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {6985#(= (+ (- 1) main_~j~0) 0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6986#(<= main_~j~0 2)} is VALID [2022-04-08 03:37:47,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {6986#(<= main_~j~0 2)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6987#(<= main_~i~0 1)} is VALID [2022-04-08 03:37:47,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {6987#(<= main_~i~0 1)} #t~short10 := ~i~0 >= 0; {6987#(<= main_~i~0 1)} is VALID [2022-04-08 03:37:47,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {6987#(<= main_~i~0 1)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6987#(<= main_~i~0 1)} is VALID [2022-04-08 03:37:47,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {6987#(<= main_~i~0 1)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {6988#(<= main_~i~0 0)} is VALID [2022-04-08 03:37:47,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {6988#(<= main_~i~0 0)} #t~short10 := ~i~0 >= 0; {6988#(<= main_~i~0 0)} is VALID [2022-04-08 03:37:47,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {6988#(<= main_~i~0 0)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6988#(<= main_~i~0 0)} is VALID [2022-04-08 03:37:47,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {6988#(<= main_~i~0 0)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {6989#(<= (+ main_~i~0 1) 0)} is VALID [2022-04-08 03:37:47,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {6989#(<= (+ main_~i~0 1) 0)} #t~short10 := ~i~0 >= 0; {6990#(not |main_#t~short10|)} is VALID [2022-04-08 03:37:47,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {6990#(not |main_#t~short10|)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6981#false} is VALID [2022-04-08 03:37:47,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {6981#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6981#false} is VALID [2022-04-08 03:37:47,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {6981#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6981#false} is VALID [2022-04-08 03:37:47,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {6981#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6981#false} is VALID [2022-04-08 03:37:47,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {6981#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6981#false} is VALID [2022-04-08 03:37:47,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {6981#false} ~k~0 := 1; {6981#false} is VALID [2022-04-08 03:37:47,509 INFO L290 TraceCheckUtils]: 34: Hoare triple {6981#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {6981#false} is VALID [2022-04-08 03:37:47,509 INFO L272 TraceCheckUtils]: 35: Hoare triple {6981#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {6981#false} is VALID [2022-04-08 03:37:47,509 INFO L290 TraceCheckUtils]: 36: Hoare triple {6981#false} ~cond := #in~cond; {6981#false} is VALID [2022-04-08 03:37:47,509 INFO L290 TraceCheckUtils]: 37: Hoare triple {6981#false} assume 0 == ~cond; {6981#false} is VALID [2022-04-08 03:37:47,509 INFO L290 TraceCheckUtils]: 38: Hoare triple {6981#false} assume !false; {6981#false} is VALID [2022-04-08 03:37:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:37:47,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:37:47,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321688464] [2022-04-08 03:37:47,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321688464] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:37:47,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833766579] [2022-04-08 03:37:47,510 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:37:47,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:37:47,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:37:47,511 INFO L229 MonitoredProcess]: Starting monitored process 11 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:37:47,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 03:37:47,567 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:37:47,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:37:47,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 03:37:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:37:47,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:37:47,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {6980#true} call ULTIMATE.init(); {6980#true} is VALID [2022-04-08 03:37:47,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {6980#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(19, 2);call #Ultimate.allocInit(12, 3); {6980#true} is VALID [2022-04-08 03:37:47,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {6980#true} assume true; {6980#true} is VALID [2022-04-08 03:37:47,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6980#true} {6980#true} #87#return; {6980#true} is VALID [2022-04-08 03:37:47,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {6980#true} call #t~ret15 := main(); {6980#true} is VALID [2022-04-08 03:37:47,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {6980#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {6980#true} is VALID [2022-04-08 03:37:47,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {6980#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6980#true} is VALID [2022-04-08 03:37:47,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {6980#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6980#true} is VALID [2022-04-08 03:37:47,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {6980#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6980#true} is VALID [2022-04-08 03:37:47,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {6980#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6980#true} is VALID [2022-04-08 03:37:47,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {6980#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6980#true} is VALID [2022-04-08 03:37:47,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {6980#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6980#true} is VALID [2022-04-08 03:37:47,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {6980#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6980#true} is VALID [2022-04-08 03:37:47,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {6980#true} ~j~0 := 1; {7034#(<= main_~j~0 1)} is VALID [2022-04-08 03:37:47,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {7034#(<= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {7034#(<= main_~j~0 1)} is VALID [2022-04-08 03:37:47,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {7034#(<= main_~j~0 1)} #t~short10 := ~i~0 >= 0; {7034#(<= main_~j~0 1)} is VALID [2022-04-08 03:37:47,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {7034#(<= main_~j~0 1)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {7034#(<= main_~j~0 1)} is VALID [2022-04-08 03:37:47,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {7034#(<= main_~j~0 1)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {7034#(<= main_~j~0 1)} is VALID [2022-04-08 03:37:47,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {7034#(<= main_~j~0 1)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {7034#(<= main_~j~0 1)} is VALID [2022-04-08 03:37:47,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {7034#(<= main_~j~0 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6986#(<= main_~j~0 2)} is VALID [2022-04-08 03:37:47,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {6986#(<= main_~j~0 2)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6987#(<= main_~i~0 1)} is VALID [2022-04-08 03:37:47,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {6987#(<= main_~i~0 1)} #t~short10 := ~i~0 >= 0; {6987#(<= main_~i~0 1)} is VALID [2022-04-08 03:37:47,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {6987#(<= main_~i~0 1)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6987#(<= main_~i~0 1)} is VALID [2022-04-08 03:37:47,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {6987#(<= main_~i~0 1)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {6988#(<= main_~i~0 0)} is VALID [2022-04-08 03:37:47,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {6988#(<= main_~i~0 0)} #t~short10 := ~i~0 >= 0; {6988#(<= main_~i~0 0)} is VALID [2022-04-08 03:37:47,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {6988#(<= main_~i~0 0)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6988#(<= main_~i~0 0)} is VALID [2022-04-08 03:37:47,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {6988#(<= main_~i~0 0)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {6989#(<= (+ main_~i~0 1) 0)} is VALID [2022-04-08 03:37:47,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {6989#(<= (+ main_~i~0 1) 0)} #t~short10 := ~i~0 >= 0; {6990#(not |main_#t~short10|)} is VALID [2022-04-08 03:37:47,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {6990#(not |main_#t~short10|)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6981#false} is VALID [2022-04-08 03:37:47,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {6981#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6981#false} is VALID [2022-04-08 03:37:47,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {6981#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6981#false} is VALID [2022-04-08 03:37:47,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {6981#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6981#false} is VALID [2022-04-08 03:37:47,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {6981#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6981#false} is VALID [2022-04-08 03:37:47,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {6981#false} ~k~0 := 1; {6981#false} is VALID [2022-04-08 03:37:47,706 INFO L290 TraceCheckUtils]: 34: Hoare triple {6981#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {6981#false} is VALID [2022-04-08 03:37:47,706 INFO L272 TraceCheckUtils]: 35: Hoare triple {6981#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {6981#false} is VALID [2022-04-08 03:37:47,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {6981#false} ~cond := #in~cond; {6981#false} is VALID [2022-04-08 03:37:47,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {6981#false} assume 0 == ~cond; {6981#false} is VALID [2022-04-08 03:37:47,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {6981#false} assume !false; {6981#false} is VALID [2022-04-08 03:37:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:37:47,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:37:47,862 INFO L290 TraceCheckUtils]: 38: Hoare triple {6981#false} assume !false; {6981#false} is VALID [2022-04-08 03:37:47,862 INFO L290 TraceCheckUtils]: 37: Hoare triple {6981#false} assume 0 == ~cond; {6981#false} is VALID [2022-04-08 03:37:47,862 INFO L290 TraceCheckUtils]: 36: Hoare triple {6981#false} ~cond := #in~cond; {6981#false} is VALID [2022-04-08 03:37:47,862 INFO L272 TraceCheckUtils]: 35: Hoare triple {6981#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {6981#false} is VALID [2022-04-08 03:37:47,863 INFO L290 TraceCheckUtils]: 34: Hoare triple {6981#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {6981#false} is VALID [2022-04-08 03:37:47,863 INFO L290 TraceCheckUtils]: 33: Hoare triple {6981#false} ~k~0 := 1; {6981#false} is VALID [2022-04-08 03:37:47,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {6981#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6981#false} is VALID [2022-04-08 03:37:47,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {6981#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6981#false} is VALID [2022-04-08 03:37:47,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {6981#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6981#false} is VALID [2022-04-08 03:37:47,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {6981#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6981#false} is VALID [2022-04-08 03:37:47,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {6990#(not |main_#t~short10|)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6981#false} is VALID [2022-04-08 03:37:47,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {6989#(<= (+ main_~i~0 1) 0)} #t~short10 := ~i~0 >= 0; {6990#(not |main_#t~short10|)} is VALID [2022-04-08 03:37:47,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {6988#(<= main_~i~0 0)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {6989#(<= (+ main_~i~0 1) 0)} is VALID [2022-04-08 03:37:47,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {6988#(<= main_~i~0 0)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6988#(<= main_~i~0 0)} is VALID [2022-04-08 03:37:47,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {6988#(<= main_~i~0 0)} #t~short10 := ~i~0 >= 0; {6988#(<= main_~i~0 0)} is VALID [2022-04-08 03:37:47,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {6987#(<= main_~i~0 1)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {6988#(<= main_~i~0 0)} is VALID [2022-04-08 03:37:47,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {6987#(<= main_~i~0 1)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6987#(<= main_~i~0 1)} is VALID [2022-04-08 03:37:47,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {6987#(<= main_~i~0 1)} #t~short10 := ~i~0 >= 0; {6987#(<= main_~i~0 1)} is VALID [2022-04-08 03:37:47,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {6986#(<= main_~j~0 2)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6987#(<= main_~i~0 1)} is VALID [2022-04-08 03:37:47,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {7034#(<= main_~j~0 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6986#(<= main_~j~0 2)} is VALID [2022-04-08 03:37:47,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {7034#(<= main_~j~0 1)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {7034#(<= main_~j~0 1)} is VALID [2022-04-08 03:37:47,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {7034#(<= main_~j~0 1)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {7034#(<= main_~j~0 1)} is VALID [2022-04-08 03:37:47,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {7034#(<= main_~j~0 1)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {7034#(<= main_~j~0 1)} is VALID [2022-04-08 03:37:47,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {7034#(<= main_~j~0 1)} #t~short10 := ~i~0 >= 0; {7034#(<= main_~j~0 1)} is VALID [2022-04-08 03:37:47,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {7034#(<= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {7034#(<= main_~j~0 1)} is VALID [2022-04-08 03:37:47,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {6980#true} ~j~0 := 1; {7034#(<= main_~j~0 1)} is VALID [2022-04-08 03:37:47,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {6980#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6980#true} is VALID [2022-04-08 03:37:47,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {6980#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6980#true} is VALID [2022-04-08 03:37:47,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {6980#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6980#true} is VALID [2022-04-08 03:37:47,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {6980#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6980#true} is VALID [2022-04-08 03:37:47,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {6980#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6980#true} is VALID [2022-04-08 03:37:47,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {6980#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6980#true} is VALID [2022-04-08 03:37:47,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {6980#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6980#true} is VALID [2022-04-08 03:37:47,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {6980#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {6980#true} is VALID [2022-04-08 03:37:47,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {6980#true} call #t~ret15 := main(); {6980#true} is VALID [2022-04-08 03:37:47,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6980#true} {6980#true} #87#return; {6980#true} is VALID [2022-04-08 03:37:47,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {6980#true} assume true; {6980#true} is VALID [2022-04-08 03:37:47,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {6980#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(19, 2);call #Ultimate.allocInit(12, 3); {6980#true} is VALID [2022-04-08 03:37:47,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {6980#true} call ULTIMATE.init(); {6980#true} is VALID [2022-04-08 03:37:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:37:47,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833766579] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:37:47,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:37:47,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2022-04-08 03:37:47,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:37:47,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [426168631] [2022-04-08 03:37:47,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [426168631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:37:47,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:37:47,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:37:47,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331325457] [2022-04-08 03:37:47,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:37:47,873 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 39 [2022-04-08 03:37:47,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:37:47,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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:37:47,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:37:47,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 03:37:47,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:37:47,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 03:37:47,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 03:37:47,899 INFO L87 Difference]: Start difference. First operand 91 states and 118 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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:37:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:37:49,034 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2022-04-08 03:37:49,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 03:37:49,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 39 [2022-04-08 03:37:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:37:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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:37:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-04-08 03:37:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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:37:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-04-08 03:37:49,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 117 transitions. [2022-04-08 03:37:49,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:37:49,130 INFO L225 Difference]: With dead ends: 162 [2022-04-08 03:37:49,130 INFO L226 Difference]: Without dead ends: 118 [2022-04-08 03:37:49,130 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2022-04-08 03:37:49,131 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 87 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:37:49,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 52 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:37:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-08 03:37:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 68. [2022-04-08 03:37:49,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:37:49,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:37:49,328 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:37:49,328 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:37:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:37:49,330 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2022-04-08 03:37:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2022-04-08 03:37:49,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:37:49,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:37:49,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 118 states. [2022-04-08 03:37:49,331 INFO L87 Difference]: Start difference. First operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 118 states. [2022-04-08 03:37:49,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:37:49,333 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2022-04-08 03:37:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2022-04-08 03:37:49,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:37:49,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:37:49,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:37:49,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:37:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:37:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2022-04-08 03:37:49,334 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 39 [2022-04-08 03:37:49,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:37:49,334 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2022-04-08 03:37:49,334 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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:37:49,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 81 transitions. [2022-04-08 03:37:49,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:37:49,491 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-04-08 03:37:49,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 03:37:49,491 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:37:49,491 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:37:49,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 03:37:49,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 03:37:49,692 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:37:49,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:37:49,692 INFO L85 PathProgramCache]: Analyzing trace with hash -930331484, now seen corresponding path program 5 times [2022-04-08 03:37:49,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:37:49,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [875531069] [2022-04-08 03:37:49,695 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:37:49,695 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:37:49,695 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:37:49,695 INFO L85 PathProgramCache]: Analyzing trace with hash -930331484, now seen corresponding path program 6 times [2022-04-08 03:37:49,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:37:49,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469694826] [2022-04-08 03:37:49,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:37:49,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:37:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:37:50,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:37:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:37:50,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {7974#(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(19, 2);call #Ultimate.allocInit(12, 3); {7952#true} is VALID [2022-04-08 03:37:50,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {7952#true} assume true; {7952#true} is VALID [2022-04-08 03:37:50,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7952#true} {7952#true} #87#return; {7952#true} is VALID [2022-04-08 03:37:50,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {7952#true} call ULTIMATE.init(); {7974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:37:50,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {7974#(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(19, 2);call #Ultimate.allocInit(12, 3); {7952#true} is VALID [2022-04-08 03:37:50,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {7952#true} assume true; {7952#true} is VALID [2022-04-08 03:37:50,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7952#true} {7952#true} #87#return; {7952#true} is VALID [2022-04-08 03:37:50,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {7952#true} call #t~ret15 := main(); {7952#true} is VALID [2022-04-08 03:37:50,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {7952#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {7957#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-08 03:37:50,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {7957#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {7957#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-08 03:37:50,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {7957#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7958#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:37:50,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {7958#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {7958#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:37:50,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {7958#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7959#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:37:50,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {7959#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {7959#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:37:50,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {7959#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7959#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:37:50,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {7959#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {7959#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:37:50,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {7959#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {7958#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:37:50,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {7958#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {7960#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) (+ 4 (* main_~i~0 4))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:37:50,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {7960#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) (+ 4 (* main_~i~0 4))) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {7960#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) (+ 4 (* main_~i~0 4))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:37:50,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {7960#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) (+ 4 (* main_~i~0 4))) (= 0 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {7960#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) (+ 4 (* main_~i~0 4))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:37:50,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {7960#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) (+ 4 (* main_~i~0 4))) (= 0 (* main_~i~0 4)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {7960#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) (+ 4 (* main_~i~0 4))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:37:50,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {7960#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) (+ 4 (* main_~i~0 4))) (= 0 (* main_~i~0 4)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {7958#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:37:50,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {7958#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7961#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2))} is VALID [2022-04-08 03:37:50,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {7961#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {7962#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-08 03:37:50,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {7962#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} #t~short10 := ~i~0 >= 0; {7962#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-08 03:37:50,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {7962#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {7962#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-08 03:37:50,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {7962#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {7963#(and (= |main_~#v~0.offset| 0) (or (<= (+ main_~i~0 1) 0) (= 0 (* main_~i~0 4))))} is VALID [2022-04-08 03:37:50,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {7963#(and (= |main_~#v~0.offset| 0) (or (<= (+ main_~i~0 1) 0) (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {7964#(and (= |main_~#v~0.offset| 0) (or (not |main_#t~short10|) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:37:50,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {7964#(and (= |main_~#v~0.offset| 0) (or (not |main_#t~short10|) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {7965#(and (= |main_~#v~0.offset| 0) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:37:50,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {7965#(and (= |main_~#v~0.offset| 0) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 0 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {7966#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-08 03:37:50,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {7966#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} #t~short10 := ~i~0 >= 0; {7967#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (and (<= 0 (+ main_~i~0 1)) |main_#t~short10|)))} is VALID [2022-04-08 03:37:50,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {7967#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (and (<= 0 (+ main_~i~0 1)) |main_#t~short10|)))} assume !#t~short10; {7968#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-08 03:37:50,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {7968#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {7968#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-08 03:37:50,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {7968#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {7969#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:37:50,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {7969#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7969#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:37:50,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {7969#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {7969#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:37:50,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {7969#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {7970#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-08 03:37:50,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {7970#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {7971#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-08 03:37:50,193 INFO L272 TraceCheckUtils]: 35: Hoare triple {7971#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {7972#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:37:50,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {7972#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7973#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:37:50,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {7973#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7953#false} is VALID [2022-04-08 03:37:50,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {7953#false} assume !false; {7953#false} is VALID [2022-04-08 03:37:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 03:37:50,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:37:50,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469694826] [2022-04-08 03:37:50,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469694826] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:37:50,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639698579] [2022-04-08 03:37:50,194 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:37:50,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:37:50,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:37:50,200 INFO L229 MonitoredProcess]: Starting monitored process 12 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:37:50,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 03:37:50,294 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 03:37:50,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:37:50,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 03:37:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:37:50,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:37:50,541 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-08 03:37:50,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2022-04-08 03:37:50,817 INFO L356 Elim1Store]: treesize reduction 76, result has 10.6 percent of original size [2022-04-08 03:37:50,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 28 [2022-04-08 03:37:51,203 INFO L356 Elim1Store]: treesize reduction 36, result has 7.7 percent of original size [2022-04-08 03:37:51,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2022-04-08 03:37:51,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {7952#true} call ULTIMATE.init(); {7952#true} is VALID [2022-04-08 03:37:51,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {7952#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(19, 2);call #Ultimate.allocInit(12, 3); {7952#true} is VALID [2022-04-08 03:37:51,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {7952#true} assume true; {7952#true} is VALID [2022-04-08 03:37:51,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7952#true} {7952#true} #87#return; {7952#true} is VALID [2022-04-08 03:37:51,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {7952#true} call #t~ret15 := main(); {7952#true} is VALID [2022-04-08 03:37:51,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {7952#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {7952#true} is VALID [2022-04-08 03:37:51,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {7952#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {7952#true} is VALID [2022-04-08 03:37:51,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {7952#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7952#true} is VALID [2022-04-08 03:37:51,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {7952#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {7952#true} is VALID [2022-04-08 03:37:51,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {7952#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7952#true} is VALID [2022-04-08 03:37:51,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {7952#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {7952#true} is VALID [2022-04-08 03:37:51,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {7952#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7952#true} is VALID [2022-04-08 03:37:51,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {7952#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {7952#true} is VALID [2022-04-08 03:37:51,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {7952#true} ~j~0 := 1; {8017#(= main_~j~0 1)} is VALID [2022-04-08 03:37:51,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {8017#(= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {8017#(= main_~j~0 1)} is VALID [2022-04-08 03:37:51,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {8017#(= main_~j~0 1)} #t~short10 := ~i~0 >= 0; {8017#(= main_~j~0 1)} is VALID [2022-04-08 03:37:51,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {8017#(= main_~j~0 1)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {8017#(= main_~j~0 1)} is VALID [2022-04-08 03:37:51,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {8017#(= main_~j~0 1)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {8017#(= main_~j~0 1)} is VALID [2022-04-08 03:37:51,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {8017#(= main_~j~0 1)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {8017#(= main_~j~0 1)} is VALID [2022-04-08 03:37:51,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {8017#(= main_~j~0 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {8036#(= (+ (- 1) main_~j~0) 1)} is VALID [2022-04-08 03:37:51,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {8036#(= (+ (- 1) main_~j~0) 1)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {8040#(= main_~i~0 1)} is VALID [2022-04-08 03:37:51,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {8040#(= main_~i~0 1)} #t~short10 := ~i~0 >= 0; {8040#(= main_~i~0 1)} is VALID [2022-04-08 03:37:51,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {8040#(= main_~i~0 1)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {8040#(= main_~i~0 1)} is VALID [2022-04-08 03:37:51,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {8040#(= main_~i~0 1)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {8050#(= (+ main_~i~0 1) 1)} is VALID [2022-04-08 03:37:51,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {8050#(= (+ main_~i~0 1) 1)} #t~short10 := ~i~0 >= 0; {8050#(= (+ main_~i~0 1) 1)} is VALID [2022-04-08 03:37:51,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {8050#(= (+ main_~i~0 1) 1)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {8057#(and (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (= (+ main_~i~0 1) 1))} is VALID [2022-04-08 03:37:51,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {8057#(and (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (= (+ main_~i~0 1) 1))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {8061#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-08 03:37:51,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {8061#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} #t~short10 := ~i~0 >= 0; {8065#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-08 03:37:51,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {8065#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume !#t~short10; {8069#(and (< main_~i~0 0) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-08 03:37:51,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {8069#(and (< main_~i~0 0) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {8069#(and (< main_~i~0 0) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-08 03:37:51,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {8069#(and (< main_~i~0 0) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {8076#(exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1))))} is VALID [2022-04-08 03:37:51,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {8076#(exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {8076#(exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1))))} is VALID [2022-04-08 03:37:51,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {8076#(exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {8076#(exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1))))} is VALID [2022-04-08 03:37:51,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {8076#(exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1))))} ~k~0 := 1; {8086#(and (= main_~k~0 1) (exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))))} is VALID [2022-04-08 03:37:51,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {8086#(and (= main_~k~0 1) (exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {7971#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-08 03:37:51,328 INFO L272 TraceCheckUtils]: 35: Hoare triple {7971#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {8093#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:37:51,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {8093#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8097#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:37:51,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {8097#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7953#false} is VALID [2022-04-08 03:37:51,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {7953#false} assume !false; {7953#false} is VALID [2022-04-08 03:37:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:37:51,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:37:53,575 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 69 treesize of output 61 [2022-04-08 03:37:53,661 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-04-08 03:37:53,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1439 treesize of output 1331 [2022-04-08 03:37:54,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {7953#false} assume !false; {7953#false} is VALID [2022-04-08 03:37:54,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {8097#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7953#false} is VALID [2022-04-08 03:37:54,621 INFO L290 TraceCheckUtils]: 36: Hoare triple {8093#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8097#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:37:54,621 INFO L272 TraceCheckUtils]: 35: Hoare triple {8113#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {8093#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:37:54,622 INFO L290 TraceCheckUtils]: 34: Hoare triple {8117#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {8113#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:37:54,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {8121#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} ~k~0 := 1; {8117#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-08 03:37:54,622 INFO L290 TraceCheckUtils]: 32: Hoare triple {8121#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {8121#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:37:54,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {8121#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {8121#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:37:54,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {8131#(forall ((v_ArrVal_269 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_269 main_~key~0))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {8121#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-08 03:37:54,624 INFO L290 TraceCheckUtils]: 29: Hoare triple {8131#(forall ((v_ArrVal_269 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_269 main_~key~0))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {8131#(forall ((v_ArrVal_269 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_269 main_~key~0))))} is VALID [2022-04-08 03:37:54,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {8138#(or (forall ((v_ArrVal_269 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_269 main_~key~0)))) |main_#t~short10|)} assume !#t~short10; {8131#(forall ((v_ArrVal_269 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_269 main_~key~0))))} is VALID [2022-04-08 03:37:54,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {8142#(or (forall ((v_ArrVal_269 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_269 main_~key~0)))) (<= 0 main_~i~0))} #t~short10 := ~i~0 >= 0; {8138#(or (forall ((v_ArrVal_269 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_269 main_~key~0)))) |main_#t~short10|)} is VALID [2022-04-08 03:37:54,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {8146#(or (not |main_#t~short10|) (forall ((v_ArrVal_269 Int) (v_ArrVal_267 Int) (v_main_~i~0_36 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_267) (+ |main_~#v~0.offset| 4 (* v_main_~i~0_36 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_267) (+ |main_~#v~0.offset| 4 (* v_main_~i~0_36 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (<= 0 v_main_~i~0_36) (not (<= main_~i~0 (+ v_main_~i~0_36 1))) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_267)) (not (<= v_ArrVal_269 main_~key~0)))))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {8142#(or (forall ((v_ArrVal_269 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_269 main_~key~0)))) (<= 0 main_~i~0))} is VALID [2022-04-08 03:37:54,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {8150#(or (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {8146#(or (not |main_#t~short10|) (forall ((v_ArrVal_269 Int) (v_ArrVal_267 Int) (v_main_~i~0_36 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_267) (+ |main_~#v~0.offset| 4 (* v_main_~i~0_36 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_267) (+ |main_~#v~0.offset| 4 (* v_main_~i~0_36 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (<= 0 v_main_~i~0_36) (not (<= main_~i~0 (+ v_main_~i~0_36 1))) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_267)) (not (<= v_ArrVal_269 main_~key~0)))))} is VALID [2022-04-08 03:37:54,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {8150#(or (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {8150#(or (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:37:54,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {8157#(or (= (+ (- 4) (* main_~i~0 4)) 0) (<= 2 main_~i~0))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {8150#(or (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:37:54,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {8157#(or (= (+ (- 4) (* main_~i~0 4)) 0) (<= 2 main_~i~0))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {8157#(or (= (+ (- 4) (* main_~i~0 4)) 0) (<= 2 main_~i~0))} is VALID [2022-04-08 03:37:54,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {8157#(or (= (+ (- 4) (* main_~i~0 4)) 0) (<= 2 main_~i~0))} #t~short10 := ~i~0 >= 0; {8157#(or (= (+ (- 4) (* main_~i~0 4)) 0) (<= 2 main_~i~0))} is VALID [2022-04-08 03:37:54,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {8167#(or (= (+ (* main_~j~0 4) (- 8)) 0) (<= 3 main_~j~0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {8157#(or (= (+ (- 4) (* main_~i~0 4)) 0) (<= 2 main_~i~0))} is VALID [2022-04-08 03:37:54,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {8171#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {8167#(or (= (+ (* main_~j~0 4) (- 8)) 0) (<= 3 main_~j~0))} is VALID [2022-04-08 03:37:54,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {8171#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {8171#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-08 03:37:54,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {8171#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {8171#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-08 03:37:54,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {8171#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {8171#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-08 03:37:54,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {8171#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} #t~short10 := ~i~0 >= 0; {8171#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-08 03:37:54,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {8171#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {8171#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-08 03:37:54,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {7952#true} ~j~0 := 1; {8171#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-08 03:37:54,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {7952#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {7952#true} is VALID [2022-04-08 03:37:54,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {7952#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7952#true} is VALID [2022-04-08 03:37:54,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {7952#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {7952#true} is VALID [2022-04-08 03:37:54,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {7952#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7952#true} is VALID [2022-04-08 03:37:54,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {7952#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {7952#true} is VALID [2022-04-08 03:37:54,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {7952#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7952#true} is VALID [2022-04-08 03:37:54,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {7952#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {7952#true} is VALID [2022-04-08 03:37:54,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {7952#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {7952#true} is VALID [2022-04-08 03:37:54,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {7952#true} call #t~ret15 := main(); {7952#true} is VALID [2022-04-08 03:37:54,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7952#true} {7952#true} #87#return; {7952#true} is VALID [2022-04-08 03:37:54,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {7952#true} assume true; {7952#true} is VALID [2022-04-08 03:37:54,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {7952#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(19, 2);call #Ultimate.allocInit(12, 3); {7952#true} is VALID [2022-04-08 03:37:54,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {7952#true} call ULTIMATE.init(); {7952#true} is VALID [2022-04-08 03:37:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:37:54,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639698579] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:37:54,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:37:54,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 15] total 43 [2022-04-08 03:37:54,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:37:54,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [875531069] [2022-04-08 03:37:54,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [875531069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:37:54,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:37:54,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 03:37:54,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446334893] [2022-04-08 03:37:54,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:37:54,635 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 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 39 [2022-04-08 03:37:54,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:37:54,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 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:37:54,666 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:37:54,666 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 03:37:54,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:37:54,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 03:37:54,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1630, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 03:37:54,667 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 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:37:57,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:37:57,946 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2022-04-08 03:37:57,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 03:37:57,946 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 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 39 [2022-04-08 03:37:57,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:37:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 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:37:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 130 transitions. [2022-04-08 03:37:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 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:37:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 130 transitions. [2022-04-08 03:37:57,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 130 transitions. [2022-04-08 03:37:58,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:37:58,080 INFO L225 Difference]: With dead ends: 129 [2022-04-08 03:37:58,080 INFO L226 Difference]: Without dead ends: 127 [2022-04-08 03:37:58,081 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1559 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=660, Invalid=4742, Unknown=0, NotChecked=0, Total=5402 [2022-04-08 03:37:58,081 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 162 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 03:37:58,082 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 71 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 03:37:58,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-08 03:37:58,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 68. [2022-04-08 03:37:58,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:37:58,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:37:58,308 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:37:58,308 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:37:58,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:37:58,310 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2022-04-08 03:37:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 154 transitions. [2022-04-08 03:37:58,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:37:58,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:37:58,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 127 states. [2022-04-08 03:37:58,311 INFO L87 Difference]: Start difference. First operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 127 states. [2022-04-08 03:37:58,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:37:58,313 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2022-04-08 03:37:58,313 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 154 transitions. [2022-04-08 03:37:58,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:37:58,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:37:58,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:37:58,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:37:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:37:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2022-04-08 03:37:58,314 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 39 [2022-04-08 03:37:58,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:37:58,314 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2022-04-08 03:37:58,315 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 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:37:58,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 81 transitions. [2022-04-08 03:37:58,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:37:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-04-08 03:37:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 03:37:58,515 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:37:58,515 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:37:58,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 03:37:58,715 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 03:37:58,716 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:37:58,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:37:58,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1624035100, now seen corresponding path program 3 times [2022-04-08 03:37:58,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:37:58,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1052281918] [2022-04-08 03:37:58,719 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:37:58,719 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:37:58,719 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:37:58,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1624035100, now seen corresponding path program 4 times [2022-04-08 03:37:58,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:37:58,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742605660] [2022-04-08 03:37:58,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:37:58,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:37:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:37:58,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:37:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:37:58,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {8962#(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(19, 2);call #Ultimate.allocInit(12, 3); {8941#true} is VALID [2022-04-08 03:37:58,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {8941#true} assume true; {8941#true} is VALID [2022-04-08 03:37:58,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8941#true} {8941#true} #87#return; {8941#true} is VALID [2022-04-08 03:37:58,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 03:37:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:37:58,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {8941#true} ~cond := #in~cond; {8941#true} is VALID [2022-04-08 03:37:58,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {8941#true} assume !(0 == ~cond); {8941#true} is VALID [2022-04-08 03:37:58,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {8941#true} assume true; {8941#true} is VALID [2022-04-08 03:37:58,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8941#true} {8953#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} #85#return; {8953#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-08 03:37:58,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {8941#true} call ULTIMATE.init(); {8962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:37:58,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {8962#(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(19, 2);call #Ultimate.allocInit(12, 3); {8941#true} is VALID [2022-04-08 03:37:58,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {8941#true} assume true; {8941#true} is VALID [2022-04-08 03:37:58,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8941#true} {8941#true} #87#return; {8941#true} is VALID [2022-04-08 03:37:58,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {8941#true} call #t~ret15 := main(); {8941#true} is VALID [2022-04-08 03:37:58,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {8941#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {8946#(= main_~j~0 0)} is VALID [2022-04-08 03:37:58,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {8946#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {8946#(= main_~j~0 0)} is VALID [2022-04-08 03:37:58,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {8946#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:37:58,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:37:58,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8948#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-08 03:37:58,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {8948#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {8948#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-08 03:37:58,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {8948#(and (<= main_~j~0 2) (<= 2 main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8941#true} is VALID [2022-04-08 03:37:58,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {8941#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {8941#true} is VALID [2022-04-08 03:37:58,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {8941#true} ~j~0 := 1; {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:37:58,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:37:58,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:37:58,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:37:58,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:37:58,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:37:58,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {8948#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-08 03:37:58,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {8948#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {8949#(= 4 (* main_~i~0 4))} is VALID [2022-04-08 03:37:58,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {8949#(= 4 (* main_~i~0 4))} #t~short10 := ~i~0 >= 0; {8949#(= 4 (* main_~i~0 4))} is VALID [2022-04-08 03:37:58,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {8949#(= 4 (* main_~i~0 4))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {8950#(and (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:37:58,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {8950#(and (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|) (= 4 (* main_~i~0 4)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {8951#(and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:37:58,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {8951#(and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (= 4 (* main_~i~0 4)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {8952#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-08 03:37:58,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {8952#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {8952#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-08 03:37:58,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {8952#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {8952#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-08 03:37:58,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {8952#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} ~k~0 := 1; {8953#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-08 03:37:58,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {8953#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {8953#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-08 03:37:58,972 INFO L272 TraceCheckUtils]: 29: Hoare triple {8953#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {8941#true} is VALID [2022-04-08 03:37:58,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {8941#true} ~cond := #in~cond; {8941#true} is VALID [2022-04-08 03:37:58,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {8941#true} assume !(0 == ~cond); {8941#true} is VALID [2022-04-08 03:37:58,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {8941#true} assume true; {8941#true} is VALID [2022-04-08 03:37:58,973 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8941#true} {8953#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} #85#return; {8953#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-08 03:37:58,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {8953#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} havoc #t~mem13;havoc #t~mem14; {8953#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-08 03:37:58,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {8953#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {8958#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-08 03:37:58,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {8958#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {8959#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:37:58,974 INFO L272 TraceCheckUtils]: 37: Hoare triple {8959#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {8960#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:37:58,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {8960#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8961#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:37:58,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {8961#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8942#false} is VALID [2022-04-08 03:37:58,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {8942#false} assume !false; {8942#false} is VALID [2022-04-08 03:37:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:37:58,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:37:58,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742605660] [2022-04-08 03:37:58,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742605660] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:37:58,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561056846] [2022-04-08 03:37:58,976 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:37:58,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:37:58,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:37:58,977 INFO L229 MonitoredProcess]: Starting monitored process 13 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:37:58,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 03:37:59,031 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:37:59,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:37:59,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 03:37:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:37:59,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:37:59,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-08 03:37:59,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:37:59,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 22 [2022-04-08 03:37:59,714 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-08 03:37:59,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-04-08 03:37:59,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {8941#true} call ULTIMATE.init(); {8941#true} is VALID [2022-04-08 03:37:59,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {8941#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(19, 2);call #Ultimate.allocInit(12, 3); {8941#true} is VALID [2022-04-08 03:37:59,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {8941#true} assume true; {8941#true} is VALID [2022-04-08 03:37:59,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8941#true} {8941#true} #87#return; {8941#true} is VALID [2022-04-08 03:37:59,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {8941#true} call #t~ret15 := main(); {8941#true} is VALID [2022-04-08 03:37:59,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {8941#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {8981#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:37:59,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {8981#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {8981#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:37:59,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {8981#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8981#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:37:59,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {8981#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {8981#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:37:59,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {8981#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8981#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:37:59,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {8981#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {8981#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:37:59,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {8981#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8981#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:37:59,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {8981#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {8981#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:37:59,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {8981#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {9006#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1))} is VALID [2022-04-08 03:37:59,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {9006#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {9010#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} is VALID [2022-04-08 03:37:59,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {9010#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {9010#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} is VALID [2022-04-08 03:37:59,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {9010#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {9010#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} is VALID [2022-04-08 03:37:59,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {9010#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9010#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} is VALID [2022-04-08 03:37:59,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {9010#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9006#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1))} is VALID [2022-04-08 03:37:59,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {9006#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9026#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 1))} is VALID [2022-04-08 03:37:59,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {9026#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {9030#(and (= |main_~#v~0.offset| 0) (= main_~i~0 1))} is VALID [2022-04-08 03:37:59,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {9030#(and (= |main_~#v~0.offset| 0) (= main_~i~0 1))} #t~short10 := ~i~0 >= 0; {9030#(and (= |main_~#v~0.offset| 0) (= main_~i~0 1))} is VALID [2022-04-08 03:37:59,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {9030#(and (= |main_~#v~0.offset| 0) (= main_~i~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {9037#(and (= |main_~#v~0.offset| 0) (= main_~i~0 1) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-08 03:37:59,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {9037#(and (= |main_~#v~0.offset| 0) (= main_~i~0 1) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9041#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (= main_~i~0 1))} is VALID [2022-04-08 03:37:59,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {9041#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (= main_~i~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9045#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-08 03:37:59,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {9045#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9045#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-08 03:37:59,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {9045#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {9045#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-08 03:37:59,803 INFO L290 TraceCheckUtils]: 27: Hoare triple {9045#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} ~k~0 := 1; {9055#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} is VALID [2022-04-08 03:37:59,803 INFO L290 TraceCheckUtils]: 28: Hoare triple {9055#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {9055#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} is VALID [2022-04-08 03:37:59,804 INFO L272 TraceCheckUtils]: 29: Hoare triple {9055#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {9062#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 8)))} is VALID [2022-04-08 03:37:59,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {9062#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 8)))} ~cond := #in~cond; {9062#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 8)))} is VALID [2022-04-08 03:37:59,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {9062#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 8)))} assume !(0 == ~cond); {9062#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 8)))} is VALID [2022-04-08 03:37:59,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {9062#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 8)))} assume true; {9062#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 8)))} is VALID [2022-04-08 03:37:59,806 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {9062#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 8)))} {9055#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} #85#return; {9055#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} is VALID [2022-04-08 03:37:59,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {9055#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} havoc #t~mem13;havoc #t~mem14; {9055#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} is VALID [2022-04-08 03:37:59,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {9055#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {9081#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-08 03:37:59,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {9081#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {8959#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:37:59,807 INFO L272 TraceCheckUtils]: 37: Hoare triple {8959#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {9088#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:37:59,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {9088#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9092#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:37:59,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {9092#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8942#false} is VALID [2022-04-08 03:37:59,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {8942#false} assume !false; {8942#false} is VALID [2022-04-08 03:37:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:37:59,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:02,568 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 67 treesize of output 61 [2022-04-08 03:38:02,619 INFO L356 Elim1Store]: treesize reduction 25, result has 39.0 percent of original size [2022-04-08 03:38:02,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 459 treesize of output 436 [2022-04-08 03:38:03,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {8942#false} assume !false; {8942#false} is VALID [2022-04-08 03:38:03,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {9092#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8942#false} is VALID [2022-04-08 03:38:03,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {9088#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9092#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:38:03,168 INFO L272 TraceCheckUtils]: 37: Hoare triple {8959#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {9088#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:38:03,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {8958#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {8959#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:38:03,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {9114#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {8958#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-08 03:38:03,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {9114#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} havoc #t~mem13;havoc #t~mem14; {9114#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} is VALID [2022-04-08 03:38:03,171 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8941#true} {9114#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} #85#return; {9114#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} is VALID [2022-04-08 03:38:03,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {8941#true} assume true; {8941#true} is VALID [2022-04-08 03:38:03,171 INFO L290 TraceCheckUtils]: 31: Hoare triple {8941#true} assume !(0 == ~cond); {8941#true} is VALID [2022-04-08 03:38:03,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {8941#true} ~cond := #in~cond; {8941#true} is VALID [2022-04-08 03:38:03,171 INFO L272 TraceCheckUtils]: 29: Hoare triple {9114#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {8941#true} is VALID [2022-04-08 03:38:03,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {9114#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {9114#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} is VALID [2022-04-08 03:38:03,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {8952#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} ~k~0 := 1; {9114#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} is VALID [2022-04-08 03:38:03,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {8952#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {8952#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-08 03:38:03,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {8952#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {8952#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-08 03:38:03,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {9148#(forall ((v_ArrVal_298 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8))) (not (<= main_~key~0 v_ArrVal_298))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {8952#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-08 03:38:03,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {9152#(or (forall ((v_ArrVal_298 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8))) (not (<= main_~key~0 v_ArrVal_298)))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9148#(forall ((v_ArrVal_298 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8))) (not (<= main_~key~0 v_ArrVal_298))))} is VALID [2022-04-08 03:38:03,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {9156#(forall ((v_ArrVal_298 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8))) (< v_ArrVal_298 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {9152#(or (forall ((v_ArrVal_298 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8))) (not (<= main_~key~0 v_ArrVal_298)))) |main_#t~short10|)} is VALID [2022-04-08 03:38:03,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {9156#(forall ((v_ArrVal_298 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8))) (< v_ArrVal_298 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))))} #t~short10 := ~i~0 >= 0; {9156#(forall ((v_ArrVal_298 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8))) (< v_ArrVal_298 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))))} is VALID [2022-04-08 03:38:03,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {9163#(forall ((v_ArrVal_298 Int)) (or (< v_ArrVal_298 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8)))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {9156#(forall ((v_ArrVal_298 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8))) (< v_ArrVal_298 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))))} is VALID [2022-04-08 03:38:03,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {9167#(forall ((v_ArrVal_298 Int)) (or (< v_ArrVal_298 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)))) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_298) (+ |main_~#v~0.offset| 8)))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9163#(forall ((v_ArrVal_298 Int)) (or (< v_ArrVal_298 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8)))))} is VALID [2022-04-08 03:38:03,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9167#(forall ((v_ArrVal_298 Int)) (or (< v_ArrVal_298 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)))) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_298) (+ |main_~#v~0.offset| 8)))))} is VALID [2022-04-08 03:38:03,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:03,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:03,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:03,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:03,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {8941#true} ~j~0 := 1; {8947#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:03,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {8941#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {8941#true} is VALID [2022-04-08 03:38:03,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {8941#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8941#true} is VALID [2022-04-08 03:38:03,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {8941#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {8941#true} is VALID [2022-04-08 03:38:03,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {8941#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8941#true} is VALID [2022-04-08 03:38:03,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {8941#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {8941#true} is VALID [2022-04-08 03:38:03,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {8941#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8941#true} is VALID [2022-04-08 03:38:03,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {8941#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {8941#true} is VALID [2022-04-08 03:38:03,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {8941#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {8941#true} is VALID [2022-04-08 03:38:03,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {8941#true} call #t~ret15 := main(); {8941#true} is VALID [2022-04-08 03:38:03,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8941#true} {8941#true} #87#return; {8941#true} is VALID [2022-04-08 03:38:03,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {8941#true} assume true; {8941#true} is VALID [2022-04-08 03:38:03,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {8941#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(19, 2);call #Ultimate.allocInit(12, 3); {8941#true} is VALID [2022-04-08 03:38:03,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {8941#true} call ULTIMATE.init(); {8941#true} is VALID [2022-04-08 03:38:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:38:03,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561056846] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:38:03,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:38:03,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 34 [2022-04-08 03:38:03,185 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:03,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1052281918] [2022-04-08 03:38:03,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1052281918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:03,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:03,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 03:38:03,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840249275] [2022-04-08 03:38:03,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:03,186 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-04-08 03:38:03,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:03,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:38:03,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:38:03,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 03:38:03,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:03,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 03:38:03,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=997, Unknown=1, NotChecked=0, Total=1122 [2022-04-08 03:38:03,220 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:38:05,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:05,003 INFO L93 Difference]: Finished difference Result 99 states and 117 transitions. [2022-04-08 03:38:05,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 03:38:05,004 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-04-08 03:38:05,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:38:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2022-04-08 03:38:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:38:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2022-04-08 03:38:05,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 93 transitions. [2022-04-08 03:38:05,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:38:05,095 INFO L225 Difference]: With dead ends: 99 [2022-04-08 03:38:05,095 INFO L226 Difference]: Without dead ends: 97 [2022-04-08 03:38:05,095 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=272, Invalid=2177, Unknown=1, NotChecked=0, Total=2450 [2022-04-08 03:38:05,096 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 117 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 03:38:05,096 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 75 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 03:38:05,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-08 03:38:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2022-04-08 03:38:05,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:05,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 83 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 74 states have internal predecessors, (87), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:38:05,410 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 83 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 74 states have internal predecessors, (87), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:38:05,410 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 83 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 74 states have internal predecessors, (87), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:38:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:05,411 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2022-04-08 03:38:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2022-04-08 03:38:05,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:05,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:05,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 74 states have internal predecessors, (87), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 97 states. [2022-04-08 03:38:05,412 INFO L87 Difference]: Start difference. First operand has 83 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 74 states have internal predecessors, (87), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 97 states. [2022-04-08 03:38:05,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:05,413 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2022-04-08 03:38:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2022-04-08 03:38:05,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:05,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:05,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:05,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 74 states have internal predecessors, (87), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:38:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2022-04-08 03:38:05,415 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 41 [2022-04-08 03:38:05,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:05,415 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2022-04-08 03:38:05,415 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:38:05,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 98 transitions. [2022-04-08 03:38:05,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:38:05,664 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2022-04-08 03:38:05,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 03:38:05,664 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:05,664 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:05,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 03:38:05,864 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 03:38:05,865 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:05,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:05,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1436661232, now seen corresponding path program 5 times [2022-04-08 03:38:05,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:05,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1605467379] [2022-04-08 03:38:05,869 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:38:05,869 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:38:05,869 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:38:05,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1436661232, now seen corresponding path program 6 times [2022-04-08 03:38:05,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:05,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391600975] [2022-04-08 03:38:05,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:05,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:06,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:06,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {9830#(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(19, 2);call #Ultimate.allocInit(12, 3); {9817#true} is VALID [2022-04-08 03:38:06,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {9817#true} assume true; {9817#true} is VALID [2022-04-08 03:38:06,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9817#true} {9817#true} #87#return; {9817#true} is VALID [2022-04-08 03:38:06,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {9817#true} call ULTIMATE.init(); {9830#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:06,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {9830#(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(19, 2);call #Ultimate.allocInit(12, 3); {9817#true} is VALID [2022-04-08 03:38:06,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {9817#true} assume true; {9817#true} is VALID [2022-04-08 03:38:06,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9817#true} {9817#true} #87#return; {9817#true} is VALID [2022-04-08 03:38:06,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {9817#true} call #t~ret15 := main(); {9817#true} is VALID [2022-04-08 03:38:06,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {9817#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {9822#(= main_~j~0 0)} is VALID [2022-04-08 03:38:06,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {9822#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {9822#(= main_~j~0 0)} is VALID [2022-04-08 03:38:06,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {9822#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9823#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:06,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {9823#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {9823#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:06,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {9823#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9824#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-08 03:38:06,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {9824#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {9824#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-08 03:38:06,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {9824#(and (<= main_~j~0 2) (<= 2 main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9825#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= main_~j~0 3))} is VALID [2022-04-08 03:38:06,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {9825#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= main_~j~0 3))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {9826#(<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:38:06,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {9826#(<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} #t~short10 := ~i~0 >= 0; {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9828#(and (<= main_~j~0 2) (<= main_~SIZE~0 (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:38:06,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {9828#(and (<= main_~j~0 2) (<= main_~SIZE~0 (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {9828#(and (<= main_~j~0 2) (<= main_~SIZE~0 (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:38:06,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {9828#(and (<= main_~j~0 2) (<= main_~SIZE~0 (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} #t~short10 := ~i~0 >= 0; {9828#(and (<= main_~j~0 2) (<= main_~SIZE~0 (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:38:06,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {9828#(and (<= main_~j~0 2) (<= main_~SIZE~0 (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {9828#(and (<= main_~j~0 2) (<= main_~SIZE~0 (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:38:06,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {9828#(and (<= main_~j~0 2) (<= main_~SIZE~0 (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9828#(and (<= main_~j~0 2) (<= main_~SIZE~0 (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:38:06,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {9828#(and (<= main_~j~0 2) (<= main_~SIZE~0 (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9828#(and (<= main_~j~0 2) (<= main_~SIZE~0 (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:38:06,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {9828#(and (<= main_~j~0 2) (<= main_~SIZE~0 (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9829#(and (<= (div main_~j~0 4294967296) 0) (<= main_~SIZE~0 (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-08 03:38:06,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {9829#(and (<= (div main_~j~0 4294967296) 0) (<= main_~SIZE~0 (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {9818#false} is VALID [2022-04-08 03:38:06,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {9818#false} #t~short10 := ~i~0 >= 0; {9818#false} is VALID [2022-04-08 03:38:06,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {9818#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {9818#false} is VALID [2022-04-08 03:38:06,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {9818#false} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {9818#false} is VALID [2022-04-08 03:38:06,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {9818#false} #t~short10 := ~i~0 >= 0; {9818#false} is VALID [2022-04-08 03:38:06,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {9818#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {9818#false} is VALID [2022-04-08 03:38:06,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {9818#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9818#false} is VALID [2022-04-08 03:38:06,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {9818#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9818#false} is VALID [2022-04-08 03:38:06,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {9818#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9818#false} is VALID [2022-04-08 03:38:06,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {9818#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {9818#false} is VALID [2022-04-08 03:38:06,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {9818#false} ~k~0 := 1; {9818#false} is VALID [2022-04-08 03:38:06,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {9818#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {9818#false} is VALID [2022-04-08 03:38:06,047 INFO L272 TraceCheckUtils]: 38: Hoare triple {9818#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {9818#false} is VALID [2022-04-08 03:38:06,047 INFO L290 TraceCheckUtils]: 39: Hoare triple {9818#false} ~cond := #in~cond; {9818#false} is VALID [2022-04-08 03:38:06,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {9818#false} assume 0 == ~cond; {9818#false} is VALID [2022-04-08 03:38:06,047 INFO L290 TraceCheckUtils]: 41: Hoare triple {9818#false} assume !false; {9818#false} is VALID [2022-04-08 03:38:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 03:38:06,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:06,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391600975] [2022-04-08 03:38:06,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391600975] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:38:06,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540752276] [2022-04-08 03:38:06,048 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:38:06,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:06,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:06,048 INFO L229 MonitoredProcess]: Starting monitored process 14 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:38:06,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 03:38:06,155 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 03:38:06,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:38:06,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 03:38:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:06,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:38:06,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {9817#true} call ULTIMATE.init(); {9817#true} is VALID [2022-04-08 03:38:06,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {9817#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(19, 2);call #Ultimate.allocInit(12, 3); {9817#true} is VALID [2022-04-08 03:38:06,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {9817#true} assume true; {9817#true} is VALID [2022-04-08 03:38:06,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9817#true} {9817#true} #87#return; {9817#true} is VALID [2022-04-08 03:38:06,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {9817#true} call #t~ret15 := main(); {9817#true} is VALID [2022-04-08 03:38:06,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {9817#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {9822#(= main_~j~0 0)} is VALID [2022-04-08 03:38:06,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {9822#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {9822#(= main_~j~0 0)} is VALID [2022-04-08 03:38:06,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {9822#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9823#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:06,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {9823#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {9823#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:06,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {9823#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9824#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-08 03:38:06,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {9824#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {9824#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-08 03:38:06,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {9824#(and (<= main_~j~0 2) (<= 2 main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9867#(and (<= 3 main_~j~0) (<= main_~j~0 3))} is VALID [2022-04-08 03:38:06,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {9867#(and (<= 3 main_~j~0) (<= main_~j~0 3))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {9826#(<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:38:06,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {9826#(<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} #t~short10 := ~i~0 >= 0; {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {9827#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 1) main_~j~0) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9892#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 2) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {9892#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 2) main_~j~0) 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {9892#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 2) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {9892#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 2) main_~j~0) 0))} #t~short10 := ~i~0 >= 0; {9892#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 2) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {9892#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 2) main_~j~0) 0))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {9892#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 2) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {9892#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 2) main_~j~0) 0))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9892#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 2) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {9892#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 2) main_~j~0) 0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9892#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 2) main_~j~0) 0))} is VALID [2022-04-08 03:38:06,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {9892#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ (- 2) main_~j~0) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9911#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ main_~j~0 (- 3)) 0))} is VALID [2022-04-08 03:38:06,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {9911#(and (<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296))) (= (+ main_~j~0 (- 3)) 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {9818#false} is VALID [2022-04-08 03:38:06,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {9818#false} #t~short10 := ~i~0 >= 0; {9818#false} is VALID [2022-04-08 03:38:06,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {9818#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {9818#false} is VALID [2022-04-08 03:38:06,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {9818#false} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {9818#false} is VALID [2022-04-08 03:38:06,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {9818#false} #t~short10 := ~i~0 >= 0; {9818#false} is VALID [2022-04-08 03:38:06,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {9818#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {9818#false} is VALID [2022-04-08 03:38:06,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {9818#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9818#false} is VALID [2022-04-08 03:38:06,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {9818#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9818#false} is VALID [2022-04-08 03:38:06,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {9818#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9818#false} is VALID [2022-04-08 03:38:06,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {9818#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {9818#false} is VALID [2022-04-08 03:38:06,614 INFO L290 TraceCheckUtils]: 36: Hoare triple {9818#false} ~k~0 := 1; {9818#false} is VALID [2022-04-08 03:38:06,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {9818#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {9818#false} is VALID [2022-04-08 03:38:06,614 INFO L272 TraceCheckUtils]: 38: Hoare triple {9818#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {9818#false} is VALID [2022-04-08 03:38:06,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {9818#false} ~cond := #in~cond; {9818#false} is VALID [2022-04-08 03:38:06,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {9818#false} assume 0 == ~cond; {9818#false} is VALID [2022-04-08 03:38:06,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {9818#false} assume !false; {9818#false} is VALID [2022-04-08 03:38:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 03:38:06,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:07,026 INFO L290 TraceCheckUtils]: 41: Hoare triple {9818#false} assume !false; {9818#false} is VALID [2022-04-08 03:38:07,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {9818#false} assume 0 == ~cond; {9818#false} is VALID [2022-04-08 03:38:07,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {9818#false} ~cond := #in~cond; {9818#false} is VALID [2022-04-08 03:38:07,026 INFO L272 TraceCheckUtils]: 38: Hoare triple {9818#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {9818#false} is VALID [2022-04-08 03:38:07,027 INFO L290 TraceCheckUtils]: 37: Hoare triple {9818#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {9818#false} is VALID [2022-04-08 03:38:07,027 INFO L290 TraceCheckUtils]: 36: Hoare triple {9818#false} ~k~0 := 1; {9818#false} is VALID [2022-04-08 03:38:07,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {9818#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {9818#false} is VALID [2022-04-08 03:38:07,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {9818#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9818#false} is VALID [2022-04-08 03:38:07,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {9818#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9818#false} is VALID [2022-04-08 03:38:07,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {9818#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9818#false} is VALID [2022-04-08 03:38:07,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {9818#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {9818#false} is VALID [2022-04-08 03:38:07,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {9818#false} #t~short10 := ~i~0 >= 0; {9818#false} is VALID [2022-04-08 03:38:07,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {9818#false} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {9818#false} is VALID [2022-04-08 03:38:07,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {9818#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {9818#false} is VALID [2022-04-08 03:38:07,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {9818#false} #t~short10 := ~i~0 >= 0; {9818#false} is VALID [2022-04-08 03:38:07,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {10005#(not (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {9818#false} is VALID [2022-04-08 03:38:07,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {10009#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10005#(not (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:38:07,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {10009#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {10009#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:38:07,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {10009#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {10009#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:38:07,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {10009#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {10009#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:38:07,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {10009#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} #t~short10 := ~i~0 >= 0; {10009#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:38:07,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {10009#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {10009#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:38:07,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {10028#(not (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10009#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:38:07,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {10028#(not (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {10028#(not (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:38:07,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {10028#(not (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {10028#(not (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:38:07,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {10028#(not (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {10028#(not (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:38:07,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {10028#(not (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)))} #t~short10 := ~i~0 >= 0; {10028#(not (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:38:07,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {10028#(not (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {10028#(not (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:38:07,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {9826#(<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {10028#(not (< (mod (+ main_~j~0 2) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-08 03:38:07,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {10050#(<= 0 (div (+ 3 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {9826#(<= main_~SIZE~0 (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-08 03:38:07,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {10054#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 3) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10050#(<= 0 (div (+ 3 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} is VALID [2022-04-08 03:38:07,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {10054#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 3) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {10054#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 3) 4294967296))} is VALID [2022-04-08 03:38:07,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {10061#(<= 0 (div (+ 3 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10054#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 3) 4294967296))} is VALID [2022-04-08 03:38:07,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {10061#(<= 0 (div (+ 3 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {10061#(<= 0 (div (+ 3 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-08 03:38:07,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {10068#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 3) 4294967296)) 3) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10061#(<= 0 (div (+ 3 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-08 03:38:07,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {10068#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 3) 4294967296)) 3) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {10068#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 3) 4294967296)) 3) 4294967296))} is VALID [2022-04-08 03:38:07,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {9817#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {10068#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 3) 4294967296)) 3) 4294967296))} is VALID [2022-04-08 03:38:07,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {9817#true} call #t~ret15 := main(); {9817#true} is VALID [2022-04-08 03:38:07,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9817#true} {9817#true} #87#return; {9817#true} is VALID [2022-04-08 03:38:07,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {9817#true} assume true; {9817#true} is VALID [2022-04-08 03:38:07,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {9817#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(19, 2);call #Ultimate.allocInit(12, 3); {9817#true} is VALID [2022-04-08 03:38:07,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {9817#true} call ULTIMATE.init(); {9817#true} is VALID [2022-04-08 03:38:07,038 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 03:38:07,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540752276] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:38:07,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:38:07,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2022-04-08 03:38:07,038 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:07,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1605467379] [2022-04-08 03:38:07,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1605467379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:07,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:07,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 03:38:07,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996962878] [2022-04-08 03:38:07,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:07,039 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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 42 [2022-04-08 03:38:07,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:07,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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:38:07,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:38:07,069 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 03:38:07,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:07,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 03:38:07,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-08 03:38:07,069 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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:38:08,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:08,341 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2022-04-08 03:38:08,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 03:38:08,341 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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 42 [2022-04-08 03:38:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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:38:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2022-04-08 03:38:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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:38:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2022-04-08 03:38:08,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 109 transitions. [2022-04-08 03:38:08,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:38:08,444 INFO L225 Difference]: With dead ends: 164 [2022-04-08 03:38:08,444 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 03:38:08,444 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2022-04-08 03:38:08,445 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 155 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:38:08,445 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 55 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:38:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 03:38:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2022-04-08 03:38:08,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:08,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 112 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:38:08,917 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 112 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:38:08,917 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 112 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:38:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:08,919 INFO L93 Difference]: Finished difference Result 132 states and 159 transitions. [2022-04-08 03:38:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 159 transitions. [2022-04-08 03:38:08,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:08,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:08,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 132 states. [2022-04-08 03:38:08,920 INFO L87 Difference]: Start difference. First operand has 112 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 132 states. [2022-04-08 03:38:08,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:08,922 INFO L93 Difference]: Finished difference Result 132 states and 159 transitions. [2022-04-08 03:38:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 159 transitions. [2022-04-08 03:38:08,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:08,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:08,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:08,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:38:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-04-08 03:38:08,924 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 42 [2022-04-08 03:38:08,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:08,924 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-04-08 03:38:08,924 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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:38:08,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 133 transitions. [2022-04-08 03:38:09,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:38:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-04-08 03:38:09,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 03:38:09,247 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:09,247 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:09,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 03:38:09,448 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 03:38:09,448 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:09,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:09,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2084807843, now seen corresponding path program 1 times [2022-04-08 03:38:09,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:09,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2095153933] [2022-04-08 03:38:09,452 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:38:09,452 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:38:09,452 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:38:09,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2084807843, now seen corresponding path program 2 times [2022-04-08 03:38:09,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:09,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801174351] [2022-04-08 03:38:09,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:09,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:09,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:09,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {10946#(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(19, 2);call #Ultimate.allocInit(12, 3); {10922#true} is VALID [2022-04-08 03:38:09,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-04-08 03:38:09,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10922#true} {10922#true} #87#return; {10922#true} is VALID [2022-04-08 03:38:09,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-08 03:38:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:09,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {10922#true} ~cond := #in~cond; {10922#true} is VALID [2022-04-08 03:38:09,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {10922#true} assume !(0 == ~cond); {10922#true} is VALID [2022-04-08 03:38:09,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-04-08 03:38:09,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10922#true} {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} #85#return; {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-08 03:38:09,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {10922#true} call ULTIMATE.init(); {10946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:09,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {10946#(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(19, 2);call #Ultimate.allocInit(12, 3); {10922#true} is VALID [2022-04-08 03:38:09,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-04-08 03:38:09,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10922#true} {10922#true} #87#return; {10922#true} is VALID [2022-04-08 03:38:09,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {10922#true} call #t~ret15 := main(); {10922#true} is VALID [2022-04-08 03:38:09,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {10922#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {10927#(= main_~j~0 0)} is VALID [2022-04-08 03:38:09,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {10927#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {10927#(= main_~j~0 0)} is VALID [2022-04-08 03:38:09,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {10927#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:09,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:09,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10929#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-08 03:38:09,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {10929#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {10929#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-08 03:38:09,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {10929#(and (<= main_~j~0 2) (<= 2 main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10922#true} is VALID [2022-04-08 03:38:09,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {10922#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {10922#true} is VALID [2022-04-08 03:38:09,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {10922#true} ~j~0 := 1; {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:09,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:09,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:09,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:09,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:09,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:09,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10930#(or (= (* main_~j~0 4) 8) (< main_~j~0 2))} is VALID [2022-04-08 03:38:09,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {10930#(or (= (* main_~j~0 4) 8) (< main_~j~0 2))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {10931#(or (< main_~i~0 1) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:38:09,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {10931#(or (< main_~i~0 1) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {10931#(or (< main_~i~0 1) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:38:09,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {10931#(or (< main_~i~0 1) (= 4 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {10932#(or (< main_~i~0 1) (and (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 4 (* main_~i~0 4))))} is VALID [2022-04-08 03:38:09,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {10932#(or (< main_~i~0 1) (and (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 4 (* main_~i~0 4))))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {10933#(or (<= (+ main_~i~0 1) 0) (and (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 0 (* main_~i~0 4))))} is VALID [2022-04-08 03:38:09,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {10933#(or (<= (+ main_~i~0 1) 0) (and (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {10934#(or (not |main_#t~short10|) (and (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 0 (* main_~i~0 4))))} is VALID [2022-04-08 03:38:09,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {10934#(or (not |main_#t~short10|) (and (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 0 (* main_~i~0 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {10935#(and (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:38:09,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {10935#(and (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 0 (* main_~i~0 4)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {10935#(and (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-08 03:38:09,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {10935#(and (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 0 (* main_~i~0 4)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {10936#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-08 03:38:09,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {10936#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10936#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-08 03:38:09,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {10936#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {10936#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-08 03:38:09,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {10936#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} ~k~0 := 1; {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-08 03:38:09,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-08 03:38:09,809 INFO L272 TraceCheckUtils]: 32: Hoare triple {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {10922#true} is VALID [2022-04-08 03:38:09,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {10922#true} ~cond := #in~cond; {10922#true} is VALID [2022-04-08 03:38:09,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {10922#true} assume !(0 == ~cond); {10922#true} is VALID [2022-04-08 03:38:09,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-04-08 03:38:09,809 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10922#true} {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} #85#return; {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-08 03:38:09,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} havoc #t~mem13;havoc #t~mem14; {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-08 03:38:09,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {10942#(<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-08 03:38:09,810 INFO L290 TraceCheckUtils]: 39: Hoare triple {10942#(<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {10943#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-08 03:38:09,811 INFO L272 TraceCheckUtils]: 40: Hoare triple {10943#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {10944#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:38:09,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {10944#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10945#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:38:09,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {10945#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10923#false} is VALID [2022-04-08 03:38:09,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {10923#false} assume !false; {10923#false} is VALID [2022-04-08 03:38:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:38:09,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:09,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801174351] [2022-04-08 03:38:09,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801174351] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:38:09,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964900583] [2022-04-08 03:38:09,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:38:09,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:09,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:09,813 INFO L229 MonitoredProcess]: Starting monitored process 15 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:38:09,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 03:38:09,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:38:09,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:38:09,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 03:38:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:09,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:38:10,196 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-08 03:38:10,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2022-04-08 03:38:10,815 INFO L356 Elim1Store]: treesize reduction 108, result has 10.0 percent of original size [2022-04-08 03:38:10,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 31 [2022-04-08 03:38:19,247 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-08 03:38:19,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 12 [2022-04-08 03:38:19,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {10922#true} call ULTIMATE.init(); {10922#true} is VALID [2022-04-08 03:38:19,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {10922#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(19, 2);call #Ultimate.allocInit(12, 3); {10922#true} is VALID [2022-04-08 03:38:19,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-04-08 03:38:19,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10922#true} {10922#true} #87#return; {10922#true} is VALID [2022-04-08 03:38:19,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {10922#true} call #t~ret15 := main(); {10922#true} is VALID [2022-04-08 03:38:19,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {10922#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {10922#true} is VALID [2022-04-08 03:38:19,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {10922#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {10922#true} is VALID [2022-04-08 03:38:19,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {10922#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10922#true} is VALID [2022-04-08 03:38:19,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {10922#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {10922#true} is VALID [2022-04-08 03:38:19,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {10922#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10922#true} is VALID [2022-04-08 03:38:19,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {10922#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {10922#true} is VALID [2022-04-08 03:38:19,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {10922#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10922#true} is VALID [2022-04-08 03:38:19,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {10922#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {10922#true} is VALID [2022-04-08 03:38:19,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {10922#true} ~j~0 := 1; {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:19,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:19,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:19,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:19,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:19,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:19,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {10928#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10929#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-08 03:38:19,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {10929#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {11010#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 03:38:19,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {11010#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~short10 := ~i~0 >= 0; {11010#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 03:38:19,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {11010#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {11017#(and (<= main_~i~0 1) (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (<= 1 main_~i~0))} is VALID [2022-04-08 03:38:19,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {11017#(and (<= main_~i~0 1) (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (<= 1 main_~i~0))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {11021#(exists ((v_main_~i~0_47 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|))) (<= v_main_~i~0_47 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset| 4))) (<= (+ main_~i~0 1) v_main_~i~0_47) (<= 1 v_main_~i~0_47)))} is VALID [2022-04-08 03:38:19,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {11021#(exists ((v_main_~i~0_47 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|))) (<= v_main_~i~0_47 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset| 4))) (<= (+ main_~i~0 1) v_main_~i~0_47) (<= 1 v_main_~i~0_47)))} #t~short10 := ~i~0 >= 0; {11025#(and (exists ((v_main_~i~0_47 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|))) (<= v_main_~i~0_47 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset| 4))) (<= (+ main_~i~0 1) v_main_~i~0_47) (<= 1 v_main_~i~0_47))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-08 03:38:19,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {11025#(and (exists ((v_main_~i~0_47 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|))) (<= v_main_~i~0_47 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset| 4))) (<= (+ main_~i~0 1) v_main_~i~0_47) (<= 1 v_main_~i~0_47))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {11029#(and (exists ((v_main_~i~0_47 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|))) (<= v_main_~i~0_47 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset| 4))) (<= (+ main_~i~0 1) v_main_~i~0_47))) (<= 0 main_~i~0))} is VALID [2022-04-08 03:38:19,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {11029#(and (exists ((v_main_~i~0_47 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|))) (<= v_main_~i~0_47 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset| 4))) (<= (+ main_~i~0 1) v_main_~i~0_47))) (<= 0 main_~i~0))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {11029#(and (exists ((v_main_~i~0_47 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|))) (<= v_main_~i~0_47 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset| 4))) (<= (+ main_~i~0 1) v_main_~i~0_47))) (<= 0 main_~i~0))} is VALID [2022-04-08 03:38:19,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {11029#(and (exists ((v_main_~i~0_47 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|))) (<= v_main_~i~0_47 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset| 4))) (<= (+ main_~i~0 1) v_main_~i~0_47))) (<= 0 main_~i~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {10936#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-08 03:38:19,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {10936#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10936#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-08 03:38:19,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {10936#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {10936#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-08 03:38:19,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {10936#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} ~k~0 := 1; {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-08 03:38:19,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-08 03:38:19,342 INFO L272 TraceCheckUtils]: 32: Hoare triple {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {11051#(exists ((|v_main_~#v~0.base_BEFORE_CALL_3| Int) (|v_main_~#v~0.offset_BEFORE_CALL_3| Int)) (<= (+ (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ |v_main_~#v~0.offset_BEFORE_CALL_3| 4)) 1) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ 8 |v_main_~#v~0.offset_BEFORE_CALL_3|))))} is VALID [2022-04-08 03:38:19,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {11051#(exists ((|v_main_~#v~0.base_BEFORE_CALL_3| Int) (|v_main_~#v~0.offset_BEFORE_CALL_3| Int)) (<= (+ (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ |v_main_~#v~0.offset_BEFORE_CALL_3| 4)) 1) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ 8 |v_main_~#v~0.offset_BEFORE_CALL_3|))))} ~cond := #in~cond; {11051#(exists ((|v_main_~#v~0.base_BEFORE_CALL_3| Int) (|v_main_~#v~0.offset_BEFORE_CALL_3| Int)) (<= (+ (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ |v_main_~#v~0.offset_BEFORE_CALL_3| 4)) 1) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ 8 |v_main_~#v~0.offset_BEFORE_CALL_3|))))} is VALID [2022-04-08 03:38:19,343 INFO L290 TraceCheckUtils]: 34: Hoare triple {11051#(exists ((|v_main_~#v~0.base_BEFORE_CALL_3| Int) (|v_main_~#v~0.offset_BEFORE_CALL_3| Int)) (<= (+ (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ |v_main_~#v~0.offset_BEFORE_CALL_3| 4)) 1) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ 8 |v_main_~#v~0.offset_BEFORE_CALL_3|))))} assume !(0 == ~cond); {11051#(exists ((|v_main_~#v~0.base_BEFORE_CALL_3| Int) (|v_main_~#v~0.offset_BEFORE_CALL_3| Int)) (<= (+ (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ |v_main_~#v~0.offset_BEFORE_CALL_3| 4)) 1) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ 8 |v_main_~#v~0.offset_BEFORE_CALL_3|))))} is VALID [2022-04-08 03:38:19,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {11051#(exists ((|v_main_~#v~0.base_BEFORE_CALL_3| Int) (|v_main_~#v~0.offset_BEFORE_CALL_3| Int)) (<= (+ (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ |v_main_~#v~0.offset_BEFORE_CALL_3| 4)) 1) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ 8 |v_main_~#v~0.offset_BEFORE_CALL_3|))))} assume true; {11051#(exists ((|v_main_~#v~0.base_BEFORE_CALL_3| Int) (|v_main_~#v~0.offset_BEFORE_CALL_3| Int)) (<= (+ (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ |v_main_~#v~0.offset_BEFORE_CALL_3| 4)) 1) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ 8 |v_main_~#v~0.offset_BEFORE_CALL_3|))))} is VALID [2022-04-08 03:38:19,343 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11051#(exists ((|v_main_~#v~0.base_BEFORE_CALL_3| Int) (|v_main_~#v~0.offset_BEFORE_CALL_3| Int)) (<= (+ (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ |v_main_~#v~0.offset_BEFORE_CALL_3| 4)) 1) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ 8 |v_main_~#v~0.offset_BEFORE_CALL_3|))))} {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} #85#return; {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-08 03:38:19,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} havoc #t~mem13;havoc #t~mem14; {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-08 03:38:19,344 INFO L290 TraceCheckUtils]: 38: Hoare triple {10937#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {11070#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 2))} is VALID [2022-04-08 03:38:19,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {11070#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 2))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {10943#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-08 03:38:19,345 INFO L272 TraceCheckUtils]: 40: Hoare triple {10943#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {11077#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:38:19,346 INFO L290 TraceCheckUtils]: 41: Hoare triple {11077#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11081#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:38:19,346 INFO L290 TraceCheckUtils]: 42: Hoare triple {11081#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10923#false} is VALID [2022-04-08 03:38:19,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {10923#false} assume !false; {10923#false} is VALID [2022-04-08 03:38:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:38:19,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:24,452 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 71 treesize of output 63 [2022-04-08 03:38:24,548 INFO L356 Elim1Store]: treesize reduction 31, result has 24.4 percent of original size [2022-04-08 03:38:24,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 439 treesize of output 405 [2022-04-08 03:38:25,163 INFO L290 TraceCheckUtils]: 43: Hoare triple {10923#false} assume !false; {10923#false} is VALID [2022-04-08 03:38:25,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {11081#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10923#false} is VALID [2022-04-08 03:38:25,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {11077#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11081#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:38:25,165 INFO L272 TraceCheckUtils]: 40: Hoare triple {11097#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {11077#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:38:25,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {11101#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {11097#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:38:25,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {11105#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {11101#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-08 03:38:25,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {11105#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} havoc #t~mem13;havoc #t~mem14; {11105#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} is VALID [2022-04-08 03:38:25,167 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10922#true} {11105#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} #85#return; {11105#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} is VALID [2022-04-08 03:38:25,167 INFO L290 TraceCheckUtils]: 35: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-04-08 03:38:25,167 INFO L290 TraceCheckUtils]: 34: Hoare triple {10922#true} assume !(0 == ~cond); {10922#true} is VALID [2022-04-08 03:38:25,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {10922#true} ~cond := #in~cond; {10922#true} is VALID [2022-04-08 03:38:25,167 INFO L272 TraceCheckUtils]: 32: Hoare triple {11105#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {10922#true} is VALID [2022-04-08 03:38:25,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {11105#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {11105#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} is VALID [2022-04-08 03:38:25,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {11130#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} ~k~0 := 1; {11105#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} is VALID [2022-04-08 03:38:25,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {11130#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {11130#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-08 03:38:25,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {11130#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {11130#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-08 03:38:25,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {11140#(forall ((v_ArrVal_361 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 8)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {11130#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-08 03:38:25,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {11140#(forall ((v_ArrVal_361 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 8)))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {11140#(forall ((v_ArrVal_361 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 8)))))} is VALID [2022-04-08 03:38:25,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {11147#(or (not |main_#t~short10|) (forall ((v_ArrVal_361 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 8))))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {11140#(forall ((v_ArrVal_361 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 8)))))} is VALID [2022-04-08 03:38:25,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {11151#(or (not (<= 0 main_~i~0)) (forall ((v_ArrVal_361 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 8))))))} #t~short10 := ~i~0 >= 0; {11147#(or (not |main_#t~short10|) (forall ((v_ArrVal_361 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 8))))))} is VALID [2022-04-08 03:38:25,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {11155#(or (not |main_#t~short10|) (forall ((v_main_~i~0_48 Int) (v_ArrVal_361 Int) (v_ArrVal_359 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (not (<= 0 v_main_~i~0_48)) (not (<= (+ v_main_~i~0_48 1) main_~i~0)) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_359)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_359) (+ |main_~#v~0.offset| (* v_main_~i~0_48 4) 4) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_359) (+ |main_~#v~0.offset| (* v_main_~i~0_48 4) 4) v_ArrVal_361) (+ |main_~#v~0.offset| 8))))))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {11151#(or (not (<= 0 main_~i~0)) (forall ((v_ArrVal_361 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 8))))))} is VALID [2022-04-08 03:38:25,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {10931#(or (< main_~i~0 1) (= 4 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {11155#(or (not |main_#t~short10|) (forall ((v_main_~i~0_48 Int) (v_ArrVal_361 Int) (v_ArrVal_359 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (not (<= 0 v_main_~i~0_48)) (not (<= (+ v_main_~i~0_48 1) main_~i~0)) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_359)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_359) (+ |main_~#v~0.offset| (* v_main_~i~0_48 4) 4) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_359) (+ |main_~#v~0.offset| (* v_main_~i~0_48 4) 4) v_ArrVal_361) (+ |main_~#v~0.offset| 8))))))} is VALID [2022-04-08 03:38:25,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {10931#(or (< main_~i~0 1) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {10931#(or (< main_~i~0 1) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:38:25,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {10930#(or (= (* main_~j~0 4) 8) (< main_~j~0 2))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {10931#(or (< main_~i~0 1) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:38:25,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {11168#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10930#(or (= (* main_~j~0 4) 8) (< main_~j~0 2))} is VALID [2022-04-08 03:38:25,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {11168#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {11168#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} is VALID [2022-04-08 03:38:25,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {11168#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {11168#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} is VALID [2022-04-08 03:38:25,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {11168#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {11168#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} is VALID [2022-04-08 03:38:25,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {11168#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} #t~short10 := ~i~0 >= 0; {11168#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} is VALID [2022-04-08 03:38:25,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {11168#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {11168#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} is VALID [2022-04-08 03:38:25,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {10922#true} ~j~0 := 1; {11168#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} is VALID [2022-04-08 03:38:25,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {10922#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {10922#true} is VALID [2022-04-08 03:38:25,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {10922#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10922#true} is VALID [2022-04-08 03:38:25,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {10922#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {10922#true} is VALID [2022-04-08 03:38:25,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {10922#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10922#true} is VALID [2022-04-08 03:38:25,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {10922#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {10922#true} is VALID [2022-04-08 03:38:25,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {10922#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10922#true} is VALID [2022-04-08 03:38:25,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {10922#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {10922#true} is VALID [2022-04-08 03:38:25,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {10922#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {10922#true} is VALID [2022-04-08 03:38:25,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {10922#true} call #t~ret15 := main(); {10922#true} is VALID [2022-04-08 03:38:25,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10922#true} {10922#true} #87#return; {10922#true} is VALID [2022-04-08 03:38:25,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-04-08 03:38:25,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {10922#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(19, 2);call #Ultimate.allocInit(12, 3); {10922#true} is VALID [2022-04-08 03:38:25,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {10922#true} call ULTIMATE.init(); {10922#true} is VALID [2022-04-08 03:38:25,189 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 03:38:25,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964900583] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:38:25,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:38:25,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 15] total 36 [2022-04-08 03:38:25,190 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:25,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2095153933] [2022-04-08 03:38:25,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2095153933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:25,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:25,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 03:38:25,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073924144] [2022-04-08 03:38:25,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:25,191 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-04-08 03:38:25,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:25,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:38:25,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:38:25,227 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 03:38:25,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:25,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 03:38:25,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1112, Unknown=6, NotChecked=0, Total=1260 [2022-04-08 03:38:25,227 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:38:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:28,358 INFO L93 Difference]: Finished difference Result 159 states and 188 transitions. [2022-04-08 03:38:28,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 03:38:28,358 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-04-08 03:38:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:38:28,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 115 transitions. [2022-04-08 03:38:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:38:28,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 115 transitions. [2022-04-08 03:38:28,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 115 transitions. [2022-04-08 03:38:28,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:38:28,486 INFO L225 Difference]: With dead ends: 159 [2022-04-08 03:38:28,486 INFO L226 Difference]: Without dead ends: 157 [2022-04-08 03:38:28,487 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 68 SyntacticMatches, 11 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=481, Invalid=3295, Unknown=6, NotChecked=0, Total=3782 [2022-04-08 03:38:28,488 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 108 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 03:38:28,488 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 78 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 03:38:28,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-08 03:38:29,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 115. [2022-04-08 03:38:29,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:29,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 115 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 106 states have internal predecessors, (126), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:38:29,003 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 115 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 106 states have internal predecessors, (126), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:38:29,004 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 115 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 106 states have internal predecessors, (126), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:38:29,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:29,006 INFO L93 Difference]: Finished difference Result 157 states and 186 transitions. [2022-04-08 03:38:29,006 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 186 transitions. [2022-04-08 03:38:29,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:29,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:29,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 106 states have internal predecessors, (126), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 157 states. [2022-04-08 03:38:29,006 INFO L87 Difference]: Start difference. First operand has 115 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 106 states have internal predecessors, (126), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 157 states. [2022-04-08 03:38:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:29,008 INFO L93 Difference]: Finished difference Result 157 states and 186 transitions. [2022-04-08 03:38:29,008 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 186 transitions. [2022-04-08 03:38:29,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:29,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:29,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:29,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 106 states have internal predecessors, (126), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:38:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2022-04-08 03:38:29,011 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 44 [2022-04-08 03:38:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:29,011 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2022-04-08 03:38:29,011 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:38:29,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 137 transitions. [2022-04-08 03:38:29,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:38:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2022-04-08 03:38:29,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 03:38:29,355 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:29,355 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:29,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 03:38:29,562 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:29,563 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:29,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:29,563 INFO L85 PathProgramCache]: Analyzing trace with hash 521215711, now seen corresponding path program 1 times [2022-04-08 03:38:29,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:29,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [261777409] [2022-04-08 03:38:29,578 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:38:29,578 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:38:29,578 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:38:29,578 INFO L85 PathProgramCache]: Analyzing trace with hash 521215711, now seen corresponding path program 2 times [2022-04-08 03:38:29,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:29,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720525109] [2022-04-08 03:38:29,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:29,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:29,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:29,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {12156#(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(19, 2);call #Ultimate.allocInit(12, 3); {12142#true} is VALID [2022-04-08 03:38:29,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {12142#true} assume true; {12142#true} is VALID [2022-04-08 03:38:29,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12142#true} {12142#true} #87#return; {12142#true} is VALID [2022-04-08 03:38:29,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-08 03:38:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:29,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {12142#true} ~cond := #in~cond; {12142#true} is VALID [2022-04-08 03:38:29,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {12142#true} assume !(0 == ~cond); {12142#true} is VALID [2022-04-08 03:38:29,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {12142#true} assume true; {12142#true} is VALID [2022-04-08 03:38:29,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12142#true} {12143#false} #85#return; {12143#false} is VALID [2022-04-08 03:38:29,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {12142#true} call ULTIMATE.init(); {12156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:29,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {12156#(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(19, 2);call #Ultimate.allocInit(12, 3); {12142#true} is VALID [2022-04-08 03:38:29,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {12142#true} assume true; {12142#true} is VALID [2022-04-08 03:38:29,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12142#true} {12142#true} #87#return; {12142#true} is VALID [2022-04-08 03:38:29,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {12142#true} call #t~ret15 := main(); {12142#true} is VALID [2022-04-08 03:38:29,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {12142#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {12142#true} is VALID [2022-04-08 03:38:29,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {12142#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {12142#true} is VALID [2022-04-08 03:38:29,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {12142#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12142#true} is VALID [2022-04-08 03:38:29,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {12142#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {12142#true} is VALID [2022-04-08 03:38:29,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {12142#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12142#true} is VALID [2022-04-08 03:38:29,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {12142#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {12142#true} is VALID [2022-04-08 03:38:29,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {12142#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12142#true} is VALID [2022-04-08 03:38:29,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {12142#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {12142#true} is VALID [2022-04-08 03:38:29,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {12142#true} ~j~0 := 1; {12147#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-08 03:38:29,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {12147#(= (+ (- 1) main_~j~0) 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {12147#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-08 03:38:29,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {12147#(= (+ (- 1) main_~j~0) 0)} #t~short10 := ~i~0 >= 0; {12147#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-08 03:38:29,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {12147#(= (+ (- 1) main_~j~0) 0)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {12147#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-08 03:38:29,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {12147#(= (+ (- 1) main_~j~0) 0)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {12147#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-08 03:38:29,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {12147#(= (+ (- 1) main_~j~0) 0)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {12147#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-08 03:38:29,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {12147#(= (+ (- 1) main_~j~0) 0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12148#(<= 2 main_~j~0)} is VALID [2022-04-08 03:38:29,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {12148#(<= 2 main_~j~0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {12149#(<= 1 main_~i~0)} is VALID [2022-04-08 03:38:29,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {12149#(<= 1 main_~i~0)} #t~short10 := ~i~0 >= 0; {12149#(<= 1 main_~i~0)} is VALID [2022-04-08 03:38:29,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {12149#(<= 1 main_~i~0)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {12149#(<= 1 main_~i~0)} is VALID [2022-04-08 03:38:29,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {12149#(<= 1 main_~i~0)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {12150#(<= 0 main_~i~0)} is VALID [2022-04-08 03:38:29,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {12150#(<= 0 main_~i~0)} #t~short10 := ~i~0 >= 0; {12151#|main_#t~short10|} is VALID [2022-04-08 03:38:29,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {12151#|main_#t~short10|} assume !#t~short10; {12143#false} is VALID [2022-04-08 03:38:29,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {12143#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {12143#false} is VALID [2022-04-08 03:38:29,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {12143#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {12143#false} is VALID [2022-04-08 03:38:29,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {12143#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12143#false} is VALID [2022-04-08 03:38:29,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {12143#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {12143#false} is VALID [2022-04-08 03:38:29,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {12143#false} ~k~0 := 1; {12143#false} is VALID [2022-04-08 03:38:29,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {12143#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {12143#false} is VALID [2022-04-08 03:38:29,656 INFO L272 TraceCheckUtils]: 32: Hoare triple {12143#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {12142#true} is VALID [2022-04-08 03:38:29,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {12142#true} ~cond := #in~cond; {12142#true} is VALID [2022-04-08 03:38:29,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {12142#true} assume !(0 == ~cond); {12142#true} is VALID [2022-04-08 03:38:29,656 INFO L290 TraceCheckUtils]: 35: Hoare triple {12142#true} assume true; {12142#true} is VALID [2022-04-08 03:38:29,656 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12142#true} {12143#false} #85#return; {12143#false} is VALID [2022-04-08 03:38:29,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {12143#false} havoc #t~mem13;havoc #t~mem14; {12143#false} is VALID [2022-04-08 03:38:29,656 INFO L290 TraceCheckUtils]: 38: Hoare triple {12143#false} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {12143#false} is VALID [2022-04-08 03:38:29,656 INFO L290 TraceCheckUtils]: 39: Hoare triple {12143#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {12143#false} is VALID [2022-04-08 03:38:29,656 INFO L272 TraceCheckUtils]: 40: Hoare triple {12143#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {12143#false} is VALID [2022-04-08 03:38:29,656 INFO L290 TraceCheckUtils]: 41: Hoare triple {12143#false} ~cond := #in~cond; {12143#false} is VALID [2022-04-08 03:38:29,656 INFO L290 TraceCheckUtils]: 42: Hoare triple {12143#false} assume 0 == ~cond; {12143#false} is VALID [2022-04-08 03:38:29,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {12143#false} assume !false; {12143#false} is VALID [2022-04-08 03:38:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 03:38:29,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:29,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720525109] [2022-04-08 03:38:29,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720525109] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:38:29,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174433039] [2022-04-08 03:38:29,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:38:29,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:29,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:29,659 INFO L229 MonitoredProcess]: Starting monitored process 16 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:38:29,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 03:38:29,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:38:29,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:38:29,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 03:38:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:29,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:38:29,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {12142#true} call ULTIMATE.init(); {12142#true} is VALID [2022-04-08 03:38:29,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {12142#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(19, 2);call #Ultimate.allocInit(12, 3); {12142#true} is VALID [2022-04-08 03:38:29,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {12142#true} assume true; {12142#true} is VALID [2022-04-08 03:38:29,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12142#true} {12142#true} #87#return; {12142#true} is VALID [2022-04-08 03:38:29,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {12142#true} call #t~ret15 := main(); {12142#true} is VALID [2022-04-08 03:38:29,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {12142#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {12142#true} is VALID [2022-04-08 03:38:29,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {12142#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {12142#true} is VALID [2022-04-08 03:38:29,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {12142#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12142#true} is VALID [2022-04-08 03:38:29,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {12142#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {12142#true} is VALID [2022-04-08 03:38:29,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {12142#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12142#true} is VALID [2022-04-08 03:38:29,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {12142#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {12142#true} is VALID [2022-04-08 03:38:29,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {12142#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12142#true} is VALID [2022-04-08 03:38:29,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {12142#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {12142#true} is VALID [2022-04-08 03:38:29,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {12142#true} ~j~0 := 1; {12199#(<= 1 main_~j~0)} is VALID [2022-04-08 03:38:29,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {12199#(<= 1 main_~j~0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {12199#(<= 1 main_~j~0)} is VALID [2022-04-08 03:38:29,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {12199#(<= 1 main_~j~0)} #t~short10 := ~i~0 >= 0; {12199#(<= 1 main_~j~0)} is VALID [2022-04-08 03:38:29,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {12199#(<= 1 main_~j~0)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {12199#(<= 1 main_~j~0)} is VALID [2022-04-08 03:38:29,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {12199#(<= 1 main_~j~0)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {12199#(<= 1 main_~j~0)} is VALID [2022-04-08 03:38:29,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {12199#(<= 1 main_~j~0)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {12199#(<= 1 main_~j~0)} is VALID [2022-04-08 03:38:29,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {12199#(<= 1 main_~j~0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12148#(<= 2 main_~j~0)} is VALID [2022-04-08 03:38:29,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {12148#(<= 2 main_~j~0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {12149#(<= 1 main_~i~0)} is VALID [2022-04-08 03:38:29,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {12149#(<= 1 main_~i~0)} #t~short10 := ~i~0 >= 0; {12149#(<= 1 main_~i~0)} is VALID [2022-04-08 03:38:29,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {12149#(<= 1 main_~i~0)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {12149#(<= 1 main_~i~0)} is VALID [2022-04-08 03:38:29,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {12149#(<= 1 main_~i~0)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {12150#(<= 0 main_~i~0)} is VALID [2022-04-08 03:38:29,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {12150#(<= 0 main_~i~0)} #t~short10 := ~i~0 >= 0; {12151#|main_#t~short10|} is VALID [2022-04-08 03:38:29,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {12151#|main_#t~short10|} assume !#t~short10; {12143#false} is VALID [2022-04-08 03:38:29,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {12143#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {12143#false} is VALID [2022-04-08 03:38:29,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {12143#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {12143#false} is VALID [2022-04-08 03:38:29,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {12143#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12143#false} is VALID [2022-04-08 03:38:29,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {12143#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {12143#false} is VALID [2022-04-08 03:38:29,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {12143#false} ~k~0 := 1; {12143#false} is VALID [2022-04-08 03:38:29,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {12143#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {12143#false} is VALID [2022-04-08 03:38:29,857 INFO L272 TraceCheckUtils]: 32: Hoare triple {12143#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {12143#false} is VALID [2022-04-08 03:38:29,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {12143#false} ~cond := #in~cond; {12143#false} is VALID [2022-04-08 03:38:29,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {12143#false} assume !(0 == ~cond); {12143#false} is VALID [2022-04-08 03:38:29,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {12143#false} assume true; {12143#false} is VALID [2022-04-08 03:38:29,858 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12143#false} {12143#false} #85#return; {12143#false} is VALID [2022-04-08 03:38:29,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {12143#false} havoc #t~mem13;havoc #t~mem14; {12143#false} is VALID [2022-04-08 03:38:29,858 INFO L290 TraceCheckUtils]: 38: Hoare triple {12143#false} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {12143#false} is VALID [2022-04-08 03:38:29,858 INFO L290 TraceCheckUtils]: 39: Hoare triple {12143#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {12143#false} is VALID [2022-04-08 03:38:29,858 INFO L272 TraceCheckUtils]: 40: Hoare triple {12143#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {12143#false} is VALID [2022-04-08 03:38:29,858 INFO L290 TraceCheckUtils]: 41: Hoare triple {12143#false} ~cond := #in~cond; {12143#false} is VALID [2022-04-08 03:38:29,858 INFO L290 TraceCheckUtils]: 42: Hoare triple {12143#false} assume 0 == ~cond; {12143#false} is VALID [2022-04-08 03:38:29,858 INFO L290 TraceCheckUtils]: 43: Hoare triple {12143#false} assume !false; {12143#false} is VALID [2022-04-08 03:38:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 03:38:29,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:29,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {12143#false} assume !false; {12143#false} is VALID [2022-04-08 03:38:29,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {12143#false} assume 0 == ~cond; {12143#false} is VALID [2022-04-08 03:38:29,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {12143#false} ~cond := #in~cond; {12143#false} is VALID [2022-04-08 03:38:29,980 INFO L272 TraceCheckUtils]: 40: Hoare triple {12143#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {12143#false} is VALID [2022-04-08 03:38:29,980 INFO L290 TraceCheckUtils]: 39: Hoare triple {12143#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {12143#false} is VALID [2022-04-08 03:38:29,980 INFO L290 TraceCheckUtils]: 38: Hoare triple {12143#false} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {12143#false} is VALID [2022-04-08 03:38:29,980 INFO L290 TraceCheckUtils]: 37: Hoare triple {12143#false} havoc #t~mem13;havoc #t~mem14; {12143#false} is VALID [2022-04-08 03:38:29,981 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12142#true} {12143#false} #85#return; {12143#false} is VALID [2022-04-08 03:38:29,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {12142#true} assume true; {12142#true} is VALID [2022-04-08 03:38:29,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {12142#true} assume !(0 == ~cond); {12142#true} is VALID [2022-04-08 03:38:29,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {12142#true} ~cond := #in~cond; {12142#true} is VALID [2022-04-08 03:38:29,981 INFO L272 TraceCheckUtils]: 32: Hoare triple {12143#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {12142#true} is VALID [2022-04-08 03:38:29,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {12143#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {12143#false} is VALID [2022-04-08 03:38:29,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {12143#false} ~k~0 := 1; {12143#false} is VALID [2022-04-08 03:38:29,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {12143#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {12143#false} is VALID [2022-04-08 03:38:29,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {12143#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12143#false} is VALID [2022-04-08 03:38:29,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {12143#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {12143#false} is VALID [2022-04-08 03:38:29,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {12143#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {12143#false} is VALID [2022-04-08 03:38:29,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {12151#|main_#t~short10|} assume !#t~short10; {12143#false} is VALID [2022-04-08 03:38:29,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {12150#(<= 0 main_~i~0)} #t~short10 := ~i~0 >= 0; {12151#|main_#t~short10|} is VALID [2022-04-08 03:38:29,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {12149#(<= 1 main_~i~0)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {12150#(<= 0 main_~i~0)} is VALID [2022-04-08 03:38:29,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {12149#(<= 1 main_~i~0)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {12149#(<= 1 main_~i~0)} is VALID [2022-04-08 03:38:29,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {12149#(<= 1 main_~i~0)} #t~short10 := ~i~0 >= 0; {12149#(<= 1 main_~i~0)} is VALID [2022-04-08 03:38:29,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {12148#(<= 2 main_~j~0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {12149#(<= 1 main_~i~0)} is VALID [2022-04-08 03:38:29,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {12199#(<= 1 main_~j~0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12148#(<= 2 main_~j~0)} is VALID [2022-04-08 03:38:29,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {12199#(<= 1 main_~j~0)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {12199#(<= 1 main_~j~0)} is VALID [2022-04-08 03:38:29,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {12199#(<= 1 main_~j~0)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {12199#(<= 1 main_~j~0)} is VALID [2022-04-08 03:38:29,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {12199#(<= 1 main_~j~0)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {12199#(<= 1 main_~j~0)} is VALID [2022-04-08 03:38:29,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {12199#(<= 1 main_~j~0)} #t~short10 := ~i~0 >= 0; {12199#(<= 1 main_~j~0)} is VALID [2022-04-08 03:38:29,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {12199#(<= 1 main_~j~0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {12199#(<= 1 main_~j~0)} is VALID [2022-04-08 03:38:29,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {12142#true} ~j~0 := 1; {12199#(<= 1 main_~j~0)} is VALID [2022-04-08 03:38:29,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {12142#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {12142#true} is VALID [2022-04-08 03:38:29,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {12142#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12142#true} is VALID [2022-04-08 03:38:29,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {12142#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {12142#true} is VALID [2022-04-08 03:38:29,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {12142#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12142#true} is VALID [2022-04-08 03:38:29,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {12142#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {12142#true} is VALID [2022-04-08 03:38:29,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {12142#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12142#true} is VALID [2022-04-08 03:38:29,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {12142#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {12142#true} is VALID [2022-04-08 03:38:29,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {12142#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {12142#true} is VALID [2022-04-08 03:38:29,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {12142#true} call #t~ret15 := main(); {12142#true} is VALID [2022-04-08 03:38:29,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12142#true} {12142#true} #87#return; {12142#true} is VALID [2022-04-08 03:38:29,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {12142#true} assume true; {12142#true} is VALID [2022-04-08 03:38:29,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {12142#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(19, 2);call #Ultimate.allocInit(12, 3); {12142#true} is VALID [2022-04-08 03:38:29,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {12142#true} call ULTIMATE.init(); {12142#true} is VALID [2022-04-08 03:38:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 03:38:29,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174433039] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:38:29,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:38:29,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2022-04-08 03:38:29,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:38:29,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [261777409] [2022-04-08 03:38:29,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [261777409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:38:29,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:38:29,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:38:29,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925681397] [2022-04-08 03:38:29,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:38:29,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-04-08 03:38:29,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:38:29,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:38:30,026 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:38:30,026 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:38:30,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:30,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:38:30,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-08 03:38:30,027 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:38:31,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:31,272 INFO L93 Difference]: Finished difference Result 212 states and 254 transitions. [2022-04-08 03:38:31,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 03:38:31,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-04-08 03:38:31,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:38:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:38:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-08 03:38:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:38:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-08 03:38:31,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 92 transitions. [2022-04-08 03:38:31,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:38:31,352 INFO L225 Difference]: With dead ends: 212 [2022-04-08 03:38:31,352 INFO L226 Difference]: Without dead ends: 153 [2022-04-08 03:38:31,353 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-04-08 03:38:31,353 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 101 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:38:31,353 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 46 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:38:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-08 03:38:31,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 117. [2022-04-08 03:38:31,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:38:31,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 117 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:38:31,892 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 117 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:38:31,893 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 117 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:38:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:31,895 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2022-04-08 03:38:31,895 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2022-04-08 03:38:31,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:31,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:31,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 153 states. [2022-04-08 03:38:31,896 INFO L87 Difference]: Start difference. First operand has 117 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 153 states. [2022-04-08 03:38:31,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:38:31,898 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2022-04-08 03:38:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2022-04-08 03:38:31,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:38:31,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:38:31,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:38:31,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:38:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:38:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2022-04-08 03:38:31,900 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 44 [2022-04-08 03:38:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:38:31,900 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2022-04-08 03:38:31,900 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:38:31,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 135 transitions. [2022-04-08 03:38:32,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:38:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2022-04-08 03:38:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 03:38:32,248 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:38:32,248 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:38:32,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-08 03:38:32,448 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 03:38:32,449 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:38:32,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:38:32,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1979815022, now seen corresponding path program 7 times [2022-04-08 03:38:32,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:38:32,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1221333740] [2022-04-08 03:38:32,452 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:38:32,452 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:38:32,452 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:38:32,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1979815022, now seen corresponding path program 8 times [2022-04-08 03:38:32,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:38:32,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482562430] [2022-04-08 03:38:32,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:38:32,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:38:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:33,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:38:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:33,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {13428#(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(19, 2);call #Ultimate.allocInit(12, 3); {13401#true} is VALID [2022-04-08 03:38:33,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {13401#true} assume true; {13401#true} is VALID [2022-04-08 03:38:33,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13401#true} {13401#true} #87#return; {13401#true} is VALID [2022-04-08 03:38:33,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {13401#true} call ULTIMATE.init(); {13428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:38:33,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {13428#(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(19, 2);call #Ultimate.allocInit(12, 3); {13401#true} is VALID [2022-04-08 03:38:33,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {13401#true} assume true; {13401#true} is VALID [2022-04-08 03:38:33,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13401#true} {13401#true} #87#return; {13401#true} is VALID [2022-04-08 03:38:33,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {13401#true} call #t~ret15 := main(); {13401#true} is VALID [2022-04-08 03:38:33,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {13401#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {13406#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-08 03:38:33,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {13406#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {13406#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-08 03:38:33,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {13406#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {13407#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:33,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {13407#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {13407#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:33,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {13407#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {13408#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0))} is VALID [2022-04-08 03:38:33,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {13408#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {13408#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0))} is VALID [2022-04-08 03:38:33,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {13408#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {13409#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| (* main_~j~0 4)) 0)))} is VALID [2022-04-08 03:38:33,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {13409#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| (* main_~j~0 4)) 0)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {13410#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:38:33,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {13410#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {13410#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:38:33,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {13410#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {13410#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:38:33,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {13410#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {13407#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:33,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {13407#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {13411#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-08 03:38:33,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {13411#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {13412#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (or (not |main_#t~short10|) (and (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))))} is VALID [2022-04-08 03:38:33,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {13412#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (or (not |main_#t~short10|) (and (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {13413#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-08 03:38:33,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {13413#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {13414#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-08 03:38:33,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {13414#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {13415#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:38:33,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {13415#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {13416#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} is VALID [2022-04-08 03:38:33,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {13416#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {13417#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (not (= (+ 8 (* main_~i~0 4)) (* main_~j~0 4))) (<= main_~i~0 1) (or (<= (+ main_~i~0 1) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4))))))} is VALID [2022-04-08 03:38:33,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {13417#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (not (= (+ 8 (* main_~i~0 4)) (* main_~j~0 4))) (<= main_~i~0 1) (or (<= (+ main_~i~0 1) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4))))))} #t~short10 := ~i~0 >= 0; {13418#(and (= |main_~#v~0.offset| 0) (or (and (= (* main_~j~0 4) 8) (not (= (+ 8 (* main_~i~0 4)) (* main_~j~0 4))) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0))) (not |main_#t~short10|)))} is VALID [2022-04-08 03:38:33,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {13418#(and (= |main_~#v~0.offset| 0) (or (and (= (* main_~j~0 4) 8) (not (= (+ 8 (* main_~i~0 4)) (* main_~j~0 4))) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0))) (not |main_#t~short10|)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {13419#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (not (= (+ 8 (* main_~i~0 4)) (* main_~j~0 4))) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} is VALID [2022-04-08 03:38:33,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {13419#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (not (= (+ 8 (* main_~i~0 4)) (* main_~j~0 4))) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {13419#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (not (= (+ 8 (* main_~i~0 4)) (* main_~j~0 4))) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} is VALID [2022-04-08 03:38:33,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {13419#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (not (= (+ 8 (* main_~i~0 4)) (* main_~j~0 4))) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {13416#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} is VALID [2022-04-08 03:38:33,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {13416#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {13420#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 8)))) (= (* main_~j~0 4) 12))} is VALID [2022-04-08 03:38:33,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {13420#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 8)))) (= (* main_~j~0 4) 12))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {13421#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} is VALID [2022-04-08 03:38:33,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {13421#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} #t~short10 := ~i~0 >= 0; {13421#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} is VALID [2022-04-08 03:38:33,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {13421#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {13421#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} is VALID [2022-04-08 03:38:33,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {13421#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {13422#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:38:33,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {13422#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {13422#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:38:33,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {13422#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {13422#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:38:33,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {13422#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {13422#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:38:33,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {13422#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {13423#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:38:33,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {13423#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {13423#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:38:33,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {13423#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {13423#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:38:33,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {13423#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {13424#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-08 03:38:33,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {13424#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {13425#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:38:33,246 INFO L272 TraceCheckUtils]: 40: Hoare triple {13425#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {13426#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:38:33,247 INFO L290 TraceCheckUtils]: 41: Hoare triple {13426#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {13427#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:38:33,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {13427#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13402#false} is VALID [2022-04-08 03:38:33,247 INFO L290 TraceCheckUtils]: 43: Hoare triple {13402#false} assume !false; {13402#false} is VALID [2022-04-08 03:38:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:38:33,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:38:33,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482562430] [2022-04-08 03:38:33,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482562430] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:38:33,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658104322] [2022-04-08 03:38:33,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:38:33,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:38:33,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:38:33,248 INFO L229 MonitoredProcess]: Starting monitored process 17 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:38:33,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 03:38:33,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:38:33,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:38:33,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 03:38:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:38:33,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:38:33,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:38:33,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 27 [2022-04-08 03:38:33,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:38:33,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:38:33,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:38:33,862 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-08 03:38:33,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2022-04-08 03:38:33,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:38:33,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:38:33,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:38:33,964 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-08 03:38:33,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-04-08 03:38:34,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:38:34,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:38:34,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:38:34,037 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-08 03:38:34,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2022-04-08 03:38:34,115 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-08 03:38:34,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-04-08 03:38:34,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {13401#true} call ULTIMATE.init(); {13401#true} is VALID [2022-04-08 03:38:34,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {13401#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(19, 2);call #Ultimate.allocInit(12, 3); {13401#true} is VALID [2022-04-08 03:38:34,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {13401#true} assume true; {13401#true} is VALID [2022-04-08 03:38:34,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13401#true} {13401#true} #87#return; {13401#true} is VALID [2022-04-08 03:38:34,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {13401#true} call #t~ret15 := main(); {13401#true} is VALID [2022-04-08 03:38:34,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {13401#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {13410#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:38:34,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {13410#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {13410#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:38:34,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {13410#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {13410#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:38:34,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {13410#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {13410#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:38:34,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {13410#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {13410#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:38:34,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {13410#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {13410#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:38:34,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {13410#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {13410#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:38:34,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {13410#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {13410#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:38:34,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {13410#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {13410#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:38:34,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {13410#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {13410#(= |main_~#v~0.offset| 0)} is VALID [2022-04-08 03:38:34,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {13410#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {13407#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:34,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {13407#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {13480#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-08 03:38:34,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {13480#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {13484#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1) |main_#t~short10|)} is VALID [2022-04-08 03:38:34,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {13484#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1) |main_#t~short10|)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {13413#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-08 03:38:34,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {13413#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {13414#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-08 03:38:34,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {13414#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {13415#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:38:34,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {13415#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {13416#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} is VALID [2022-04-08 03:38:34,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {13416#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {13500#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= main_~j~0 (+ main_~i~0 1)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} is VALID [2022-04-08 03:38:34,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {13500#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= main_~j~0 (+ main_~i~0 1)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} #t~short10 := ~i~0 >= 0; {13500#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= main_~j~0 (+ main_~i~0 1)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} is VALID [2022-04-08 03:38:34,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {13500#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= main_~j~0 (+ main_~i~0 1)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {13500#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= main_~j~0 (+ main_~i~0 1)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} is VALID [2022-04-08 03:38:34,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {13500#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= main_~j~0 (+ main_~i~0 1)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {13500#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= main_~j~0 (+ main_~i~0 1)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} is VALID [2022-04-08 03:38:34,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {13500#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= main_~j~0 (+ main_~i~0 1)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {13416#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} is VALID [2022-04-08 03:38:34,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {13416#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {13420#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 8)))) (= (* main_~j~0 4) 12))} is VALID [2022-04-08 03:38:34,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {13420#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 8)))) (= (* main_~j~0 4) 12))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {13421#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} is VALID [2022-04-08 03:38:34,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {13421#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} #t~short10 := ~i~0 >= 0; {13421#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} is VALID [2022-04-08 03:38:34,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {13421#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {13421#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} is VALID [2022-04-08 03:38:34,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {13421#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {13422#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:38:34,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {13422#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {13422#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:38:34,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {13422#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {13422#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:38:34,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {13422#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {13422#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-08 03:38:34,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {13422#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {13423#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:38:34,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {13423#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {13423#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:38:34,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {13423#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {13423#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-08 03:38:34,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {13423#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {13424#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-08 03:38:34,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {13424#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {13425#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-08 03:38:34,208 INFO L272 TraceCheckUtils]: 40: Hoare triple {13425#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {13555#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:38:34,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {13555#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13559#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:38:34,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {13559#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13402#false} is VALID [2022-04-08 03:38:34,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {13402#false} assume !false; {13402#false} is VALID [2022-04-08 03:38:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 03:38:34,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:38:59,875 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_58 Int)) (or (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_429 Int)) (let ((.cse0 (let ((.cse1 (* c_main_~j~0 4))) (store (store (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ |c_main_~#v~0.offset| (* v_main_~i~0_58 4) 4) v_ArrVal_429) (+ |c_main_~#v~0.offset| .cse1 4) v_ArrVal_431) (+ |c_main_~#v~0.offset| .cse1) v_ArrVal_434)))) (<= (select .cse0 |c_main_~#v~0.offset|) (select .cse0 (+ |c_main_~#v~0.offset| 4))))) (not (<= c_main_~j~0 (+ v_main_~i~0_58 1))))) is different from false [2022-04-08 03:39:00,841 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_main_~i~0_58 Int) (v_ArrVal_429 Int)) (or (not (<= c_main_~j~0 v_main_~i~0_58)) (let ((.cse0 (let ((.cse1 (* c_main_~j~0 4))) (store (store (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ |c_main_~#v~0.offset| (* v_main_~i~0_58 4) 4) v_ArrVal_429) (+ |c_main_~#v~0.offset| 8 .cse1) v_ArrVal_431) (+ |c_main_~#v~0.offset| .cse1 4) v_ArrVal_434)))) (<= (select .cse0 |c_main_~#v~0.offset|) (select .cse0 (+ |c_main_~#v~0.offset| 4)))))) is different from false [2022-04-08 03:39:02,084 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_main_~i~0_58 Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int)) (or (not (<= c_main_~key~0 v_ArrVal_427)) (let ((.cse0 (let ((.cse1 (* c_main_~j~0 4))) (store (store (store (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* c_main_~i~0 4) |c_main_~#v~0.offset| 4) v_ArrVal_427) (+ |c_main_~#v~0.offset| (* v_main_~i~0_58 4) 4) v_ArrVal_429) (+ |c_main_~#v~0.offset| 8 .cse1) v_ArrVal_431) (+ |c_main_~#v~0.offset| .cse1 4) v_ArrVal_434)))) (<= (select .cse0 |c_main_~#v~0.offset|) (select .cse0 (+ |c_main_~#v~0.offset| 4)))) (not (<= c_main_~j~0 v_main_~i~0_58)))) is different from false [2022-04-08 03:39:03,803 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 89 treesize of output 83 [2022-04-08 03:39:03,977 INFO L356 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-04-08 03:39:03,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 339825 treesize of output 333695 [2022-04-08 03:39:21,885 WARN L232 SmtUtils]: Spent 17.90s on a formula simplification. DAG size of input: 672 DAG size of output: 667 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-08 03:41:45,605 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-08 03:41:45,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 03:41:45,806 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:41:45,807 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.runStrategy(AcceleratedInterpolationCore.java:300) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:275) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 03:41:45,810 INFO L158 Benchmark]: Toolchain (without parser) took 403250.56ms. Allocated memory was 217.1MB in the beginning and 761.3MB in the end (delta: 544.2MB). Free memory was 165.1MB in the beginning and 374.9MB in the end (delta: -209.8MB). Peak memory consumption was 441.9MB. Max. memory is 8.0GB. [2022-04-08 03:41:45,811 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 217.1MB. Free memory is still 181.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:41:45,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.17ms. Allocated memory is still 217.1MB. Free memory was 164.9MB in the beginning and 190.7MB in the end (delta: -25.8MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-04-08 03:41:45,811 INFO L158 Benchmark]: Boogie Preprocessor took 31.96ms. Allocated memory is still 217.1MB. Free memory was 190.2MB in the beginning and 188.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 03:41:45,811 INFO L158 Benchmark]: RCFGBuilder took 321.76ms. Allocated memory is still 217.1MB. Free memory was 188.6MB in the beginning and 176.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 03:41:45,811 INFO L158 Benchmark]: TraceAbstraction took 402712.41ms. Allocated memory was 217.1MB in the beginning and 761.3MB in the end (delta: 544.2MB). Free memory was 175.5MB in the beginning and 374.9MB in the end (delta: -199.4MB). Peak memory consumption was 452.3MB. Max. memory is 8.0GB. [2022-04-08 03:41:45,812 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.11ms. Allocated memory is still 217.1MB. Free memory is still 181.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.17ms. Allocated memory is still 217.1MB. Free memory was 164.9MB in the beginning and 190.7MB in the end (delta: -25.8MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.96ms. Allocated memory is still 217.1MB. Free memory was 190.2MB in the beginning and 188.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 321.76ms. Allocated memory is still 217.1MB. Free memory was 188.6MB in the beginning and 176.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 402712.41ms. Allocated memory was 217.1MB in the beginning and 761.3MB in the end (delta: 544.2MB). Free memory was 175.5MB in the beginning and 374.9MB in the end (delta: -199.4MB). Peak memory consumption was 452.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 03:41:45,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...