/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/compact.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:41:41,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:41:41,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:41:41,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:41:41,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:41:41,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:41:41,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:41:41,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:41:41,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:41:41,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:41:41,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:41:41,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:41:41,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:41:41,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:41:41,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:41:41,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:41:41,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:41:41,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:41:41,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:41:41,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:41:41,140 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:41:41,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:41:41,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:41:41,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:41:41,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:41:41,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:41:41,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:41:41,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:41:41,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:41:41,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:41:41,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:41:41,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:41:41,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:41:41,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:41:41,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:41:41,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:41:41,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:41:41,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:41:41,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:41:41,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:41:41,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:41:41,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:41:41,152 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:41:41,158 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:41:41,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:41:41,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:41:41,159 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:41:41,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:41:41,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:41:41,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:41:41,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:41:41,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:41:41,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:41:41,160 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:41:41,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:41:41,160 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:41:41,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:41:41,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:41:41,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:41:41,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:41:41,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:41:41,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:41:41,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:41:41,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:41:41,161 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:41:41,161 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:41:41,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:41:41,161 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:41:41,161 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 05:41:41,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:41:41,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:41:41,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:41:41,346 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:41:41,347 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:41:41,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/compact.c [2022-04-15 05:41:41,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac61bc18f/676b7f27118b4c62b242a14ce94e4719/FLAG2857b99d1 [2022-04-15 05:41:41,743 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:41:41,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/compact.c [2022-04-15 05:41:41,747 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac61bc18f/676b7f27118b4c62b242a14ce94e4719/FLAG2857b99d1 [2022-04-15 05:41:41,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac61bc18f/676b7f27118b4c62b242a14ce94e4719 [2022-04-15 05:41:41,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:41:41,757 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:41:41,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:41:41,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:41:41,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:41:41,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:41" (1/1) ... [2022-04-15 05:41:41,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584cb54d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:41, skipping insertion in model container [2022-04-15 05:41:41,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:41" (1/1) ... [2022-04-15 05:41:41,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:41:41,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:41:41,892 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/compact.c[609,622] [2022-04-15 05:41:41,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:41:41,901 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:41:41,913 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/compact.c[609,622] [2022-04-15 05:41:41,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:41:41,922 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:41:41,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:41 WrapperNode [2022-04-15 05:41:41,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:41:41,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:41:41,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:41:41,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:41:41,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:41" (1/1) ... [2022-04-15 05:41:41,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:41" (1/1) ... [2022-04-15 05:41:41,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:41" (1/1) ... [2022-04-15 05:41:41,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:41" (1/1) ... [2022-04-15 05:41:41,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:41" (1/1) ... [2022-04-15 05:41:41,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:41" (1/1) ... [2022-04-15 05:41:41,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:41" (1/1) ... [2022-04-15 05:41:41,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:41:41,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:41:41,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:41:41,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:41:41,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:41" (1/1) ... [2022-04-15 05:41:41,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:41:41,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:41,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 05:41:41,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 05:41:42,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:41:42,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:41:42,008 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:41:42,008 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:41:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:41:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:41:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:41:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:41:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 05:41:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:41:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:41:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:41:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:41:42,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:41:42,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:41:42,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:41:42,071 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:41:42,072 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:41:42,208 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:41:42,212 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:41:42,212 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 05:41:42,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:42 BoogieIcfgContainer [2022-04-15 05:41:42,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:41:42,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:41:42,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:41:42,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:41:42,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:41:41" (1/3) ... [2022-04-15 05:41:42,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315746c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:42, skipping insertion in model container [2022-04-15 05:41:42,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:41" (2/3) ... [2022-04-15 05:41:42,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315746c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:42, skipping insertion in model container [2022-04-15 05:41:42,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:42" (3/3) ... [2022-04-15 05:41:42,219 INFO L111 eAbstractionObserver]: Analyzing ICFG compact.c [2022-04-15 05:41:42,222 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:41:42,222 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:41:42,247 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:41:42,251 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 05:41:42,251 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:41:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-15 05:41:42,265 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:42,266 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:42,266 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:42,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:42,269 INFO L85 PathProgramCache]: Analyzing trace with hash 927625408, now seen corresponding path program 1 times [2022-04-15 05:41:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:42,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [470249661] [2022-04-15 05:41:42,281 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:41:42,282 INFO L85 PathProgramCache]: Analyzing trace with hash 927625408, now seen corresponding path program 2 times [2022-04-15 05:41:42,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:42,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204608595] [2022-04-15 05:41:42,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:42,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:42,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:42,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {21#true} is VALID [2022-04-15 05:41:42,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 05:41:42,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #43#return; {21#true} is VALID [2022-04-15 05:41:42,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:42,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {21#true} is VALID [2022-04-15 05:41:42,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 05:41:42,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #43#return; {21#true} is VALID [2022-04-15 05:41:42,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {21#true} is VALID [2022-04-15 05:41:42,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {21#true} is VALID [2022-04-15 05:41:42,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-15 05:41:42,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} ~i~0 := 0; {22#false} is VALID [2022-04-15 05:41:42,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume !true; {22#false} is VALID [2022-04-15 05:41:42,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-15 05:41:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:41:42,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:42,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204608595] [2022-04-15 05:41:42,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204608595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:42,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:42,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:41:42,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:42,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [470249661] [2022-04-15 05:41:42,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [470249661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:42,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:42,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:41:42,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944534687] [2022-04-15 05:41:42,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:42,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-15 05:41:42,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:42,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:42,445 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:41:42,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:42,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:41:42,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:41:42,466 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:42,571 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-04-15 05:41:42,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:41:42,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-15 05:41:42,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-15 05:41:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-15 05:41:42,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-15 05:41:42,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:42,650 INFO L225 Difference]: With dead ends: 37 [2022-04-15 05:41:42,650 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 05:41:42,653 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:41:42,658 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:42,659 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 05:41:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2022-04-15 05:41:42,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:42,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,684 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,684 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:42,695 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 05:41:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 05:41:42,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:42,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:42,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 05:41:42,696 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 05:41:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:42,697 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 05:41:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 05:41:42,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:42,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:42,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:42,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 05:41:42,700 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2022-04-15 05:41:42,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:42,700 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 05:41:42,701 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-15 05:41:42,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 05:41:42,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-15 05:41:42,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:42,718 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:42,721 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:41:42,722 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:42,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:42,725 INFO L85 PathProgramCache]: Analyzing trace with hash 927446352, now seen corresponding path program 1 times [2022-04-15 05:41:42,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:42,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [393702696] [2022-04-15 05:41:42,726 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:41:42,726 INFO L85 PathProgramCache]: Analyzing trace with hash 927446352, now seen corresponding path program 2 times [2022-04-15 05:41:42,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:42,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457741506] [2022-04-15 05:41:42,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:42,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:42,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:42,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {179#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {173#true} is VALID [2022-04-15 05:41:42,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-15 05:41:42,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173#true} {173#true} #43#return; {173#true} is VALID [2022-04-15 05:41:42,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {179#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:42,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {173#true} is VALID [2022-04-15 05:41:42,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-15 05:41:42,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} #43#return; {173#true} is VALID [2022-04-15 05:41:42,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {173#true} is VALID [2022-04-15 05:41:42,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {178#(= main_~i~0 0)} is VALID [2022-04-15 05:41:42,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < 102400); {174#false} is VALID [2022-04-15 05:41:42,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {174#false} ~i~0 := 0; {174#false} is VALID [2022-04-15 05:41:42,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {174#false} assume !(~i~0 % 4294967296 < 102400); {174#false} is VALID [2022-04-15 05:41:42,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#false} assume !false; {174#false} is VALID [2022-04-15 05:41:42,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:41:42,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:42,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457741506] [2022-04-15 05:41:42,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457741506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:42,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:42,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:41:42,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:42,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [393702696] [2022-04-15 05:41:42,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [393702696] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:42,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:42,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:41:42,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782248358] [2022-04-15 05:41:42,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:42,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-15 05:41:42,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:42,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:42,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:41:42,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:42,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:41:42,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:41:42,824 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:42,897 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 05:41:42,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:41:42,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-15 05:41:42,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-15 05:41:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-15 05:41:42,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-15 05:41:42,923 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-15 05:41:42,924 INFO L225 Difference]: With dead ends: 25 [2022-04-15 05:41:42,924 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 05:41:42,925 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:41:42,928 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:42,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 05:41:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2022-04-15 05:41:42,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:42,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,938 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,938 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:42,941 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-15 05:41:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 05:41:42,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:42,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:42,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 05:41:42,970 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 05:41:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:42,973 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-15 05:41:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 05:41:42,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:42,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:42,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:42,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 05:41:42,976 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 10 [2022-04-15 05:41:42,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:42,976 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 05:41:42,977 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:42,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-15 05:41:42,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 05:41:42,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 05:41:42,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:42,995 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:42,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:41:42,995 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:42,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:42,996 INFO L85 PathProgramCache]: Analyzing trace with hash 706936613, now seen corresponding path program 1 times [2022-04-15 05:41:42,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:42,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1174970613] [2022-04-15 05:41:43,022 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:43,022 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:43,022 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:43,022 INFO L85 PathProgramCache]: Analyzing trace with hash 706936613, now seen corresponding path program 2 times [2022-04-15 05:41:43,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:43,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186457325] [2022-04-15 05:41:43,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:43,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:43,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:43,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {311#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {304#true} is VALID [2022-04-15 05:41:43,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#true} assume true; {304#true} is VALID [2022-04-15 05:41:43,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {304#true} {304#true} #43#return; {304#true} is VALID [2022-04-15 05:41:43,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {311#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:43,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {304#true} is VALID [2022-04-15 05:41:43,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {304#true} assume true; {304#true} is VALID [2022-04-15 05:41:43,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {304#true} {304#true} #43#return; {304#true} is VALID [2022-04-15 05:41:43,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {304#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {304#true} is VALID [2022-04-15 05:41:43,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {304#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {309#(= main_~i~0 0)} is VALID [2022-04-15 05:41:43,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {309#(= main_~i~0 0)} is VALID [2022-04-15 05:41:43,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {310#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:41:43,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {305#false} is VALID [2022-04-15 05:41:43,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {305#false} ~i~0 := 0; {305#false} is VALID [2022-04-15 05:41:43,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {305#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {305#false} is VALID [2022-04-15 05:41:43,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {305#false} is VALID [2022-04-15 05:41:43,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {305#false} is VALID [2022-04-15 05:41:43,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#false} assume !(~i~0 % 4294967296 < 102400); {305#false} is VALID [2022-04-15 05:41:43,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {305#false} assume !false; {305#false} is VALID [2022-04-15 05:41:43,169 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-15 05:41:43,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:43,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186457325] [2022-04-15 05:41:43,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186457325] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:43,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684555773] [2022-04-15 05:41:43,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:43,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:43,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:43,176 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:41:43,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 05:41:43,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:41:43,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:43,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:41:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:43,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:43,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {304#true} is VALID [2022-04-15 05:41:43,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {304#true} is VALID [2022-04-15 05:41:43,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {304#true} assume true; {304#true} is VALID [2022-04-15 05:41:43,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {304#true} {304#true} #43#return; {304#true} is VALID [2022-04-15 05:41:43,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {304#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {304#true} is VALID [2022-04-15 05:41:43,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {304#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {309#(= main_~i~0 0)} is VALID [2022-04-15 05:41:43,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {309#(= main_~i~0 0)} is VALID [2022-04-15 05:41:43,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {336#(= main_~i~0 1)} is VALID [2022-04-15 05:41:43,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {336#(= main_~i~0 1)} assume !(~i~0 % 4294967296 < 102400); {305#false} is VALID [2022-04-15 05:41:43,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {305#false} ~i~0 := 0; {305#false} is VALID [2022-04-15 05:41:43,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {305#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {305#false} is VALID [2022-04-15 05:41:43,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {305#false} is VALID [2022-04-15 05:41:43,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {305#false} is VALID [2022-04-15 05:41:43,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#false} assume !(~i~0 % 4294967296 < 102400); {305#false} is VALID [2022-04-15 05:41:43,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {305#false} assume !false; {305#false} is VALID [2022-04-15 05:41:43,313 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-15 05:41:43,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:43,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {305#false} assume !false; {305#false} is VALID [2022-04-15 05:41:43,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#false} assume !(~i~0 % 4294967296 < 102400); {305#false} is VALID [2022-04-15 05:41:43,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {305#false} is VALID [2022-04-15 05:41:43,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {305#false} is VALID [2022-04-15 05:41:43,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {305#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {305#false} is VALID [2022-04-15 05:41:43,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {305#false} ~i~0 := 0; {305#false} is VALID [2022-04-15 05:41:43,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {305#false} is VALID [2022-04-15 05:41:43,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {380#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {376#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:41:43,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {380#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {380#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:43,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {304#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {380#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:43,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {304#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {304#true} is VALID [2022-04-15 05:41:43,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {304#true} {304#true} #43#return; {304#true} is VALID [2022-04-15 05:41:43,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {304#true} assume true; {304#true} is VALID [2022-04-15 05:41:43,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {304#true} is VALID [2022-04-15 05:41:43,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {304#true} is VALID [2022-04-15 05:41:43,385 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-15 05:41:43,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684555773] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:43,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:43,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 05:41:43,386 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:43,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1174970613] [2022-04-15 05:41:43,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1174970613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:43,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:43,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:41:43,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127346144] [2022-04-15 05:41:43,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:43,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:41:43,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:43,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:43,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:41:43,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:43,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:41:43,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:41:43,400 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:43,484 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-15 05:41:43,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:41:43,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:41:43,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:43,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-15 05:41:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-15 05:41:43,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-15 05:41:43,510 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-15 05:41:43,511 INFO L225 Difference]: With dead ends: 31 [2022-04-15 05:41:43,512 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 05:41:43,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 05:41:43,517 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:43,522 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:43,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 05:41:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-04-15 05:41:43,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:43,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,532 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,533 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:43,534 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-04-15 05:41:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-15 05:41:43,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:43,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:43,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 05:41:43,535 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 05:41:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:43,539 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-04-15 05:41:43,539 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-15 05:41:43,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:43,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:43,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:43,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-15 05:41:43,541 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2022-04-15 05:41:43,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:43,541 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-15 05:41:43,541 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-15 05:41:43,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-15 05:41:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 05:41:43,564 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:43,564 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:43,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 05:41:43,779 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:43,780 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:43,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:43,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1962996172, now seen corresponding path program 3 times [2022-04-15 05:41:43,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:43,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1937036806] [2022-04-15 05:41:43,790 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:43,790 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:43,790 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:43,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1962996172, now seen corresponding path program 4 times [2022-04-15 05:41:43,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:43,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033389650] [2022-04-15 05:41:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:43,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:43,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:43,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {566#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {558#true} is VALID [2022-04-15 05:41:43,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-15 05:41:43,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {558#true} {558#true} #43#return; {558#true} is VALID [2022-04-15 05:41:43,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {558#true} call ULTIMATE.init(); {566#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:43,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {566#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {558#true} is VALID [2022-04-15 05:41:43,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-15 05:41:43,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {558#true} {558#true} #43#return; {558#true} is VALID [2022-04-15 05:41:43,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {558#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {558#true} is VALID [2022-04-15 05:41:43,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {558#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {563#(= main_~i~0 0)} is VALID [2022-04-15 05:41:43,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {563#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {563#(= main_~i~0 0)} is VALID [2022-04-15 05:41:43,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:43,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:43,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {565#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:43,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {565#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2))} assume !(~i~0 % 4294967296 < 102400); {559#false} is VALID [2022-04-15 05:41:43,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {559#false} ~i~0 := 0; {559#false} is VALID [2022-04-15 05:41:43,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {559#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {559#false} is VALID [2022-04-15 05:41:43,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {559#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {559#false} is VALID [2022-04-15 05:41:43,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {559#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {559#false} is VALID [2022-04-15 05:41:43,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {559#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {559#false} is VALID [2022-04-15 05:41:43,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {559#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {559#false} is VALID [2022-04-15 05:41:43,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {559#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {559#false} is VALID [2022-04-15 05:41:43,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {559#false} assume !(~i~0 % 4294967296 < 102400); {559#false} is VALID [2022-04-15 05:41:43,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {559#false} assume !false; {559#false} is VALID [2022-04-15 05:41:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 05:41:43,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:43,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033389650] [2022-04-15 05:41:43,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033389650] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:43,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941527657] [2022-04-15 05:41:43,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:41:43,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:43,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:43,923 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:41:43,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 05:41:43,963 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:41:43,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:43,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:41:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:43,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:44,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {558#true} call ULTIMATE.init(); {558#true} is VALID [2022-04-15 05:41:44,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {558#true} is VALID [2022-04-15 05:41:44,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-15 05:41:44,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {558#true} {558#true} #43#return; {558#true} is VALID [2022-04-15 05:41:44,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {558#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {558#true} is VALID [2022-04-15 05:41:44,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {558#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {563#(= main_~i~0 0)} is VALID [2022-04-15 05:41:44,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {563#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {563#(= main_~i~0 0)} is VALID [2022-04-15 05:41:44,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:44,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:44,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {597#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:44,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {597#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(~i~0 % 4294967296 < 102400); {559#false} is VALID [2022-04-15 05:41:44,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {559#false} ~i~0 := 0; {559#false} is VALID [2022-04-15 05:41:44,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {559#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {559#false} is VALID [2022-04-15 05:41:44,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {559#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {559#false} is VALID [2022-04-15 05:41:44,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {559#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {559#false} is VALID [2022-04-15 05:41:44,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {559#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {559#false} is VALID [2022-04-15 05:41:44,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {559#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {559#false} is VALID [2022-04-15 05:41:44,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {559#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {559#false} is VALID [2022-04-15 05:41:44,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {559#false} assume !(~i~0 % 4294967296 < 102400); {559#false} is VALID [2022-04-15 05:41:44,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {559#false} assume !false; {559#false} is VALID [2022-04-15 05:41:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 05:41:44,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:44,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {559#false} assume !false; {559#false} is VALID [2022-04-15 05:41:44,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {559#false} assume !(~i~0 % 4294967296 < 102400); {559#false} is VALID [2022-04-15 05:41:44,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {559#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {559#false} is VALID [2022-04-15 05:41:44,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {559#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {559#false} is VALID [2022-04-15 05:41:44,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {559#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {559#false} is VALID [2022-04-15 05:41:44,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {559#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {559#false} is VALID [2022-04-15 05:41:44,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {559#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {559#false} is VALID [2022-04-15 05:41:44,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {559#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {559#false} is VALID [2022-04-15 05:41:44,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {559#false} ~i~0 := 0; {559#false} is VALID [2022-04-15 05:41:44,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {655#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {559#false} is VALID [2022-04-15 05:41:44,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {655#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:41:44,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {659#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:44,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {666#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {659#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:44,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {666#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {666#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:44,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {558#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {666#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:44,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {558#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {558#true} is VALID [2022-04-15 05:41:44,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {558#true} {558#true} #43#return; {558#true} is VALID [2022-04-15 05:41:44,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-15 05:41:44,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {558#true} is VALID [2022-04-15 05:41:44,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {558#true} call ULTIMATE.init(); {558#true} is VALID [2022-04-15 05:41:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 05:41:44,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941527657] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:44,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:44,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 05:41:44,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:44,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1937036806] [2022-04-15 05:41:44,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1937036806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:44,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:44,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:41:44,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621147938] [2022-04-15 05:41:44,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:44,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:41:44,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:44,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:44,295 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:41:44,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:44,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:41:44,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:41:44,296 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,410 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 05:41:44,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:41:44,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:41:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-15 05:41:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-15 05:41:44,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-04-15 05:41:44,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:44,444 INFO L225 Difference]: With dead ends: 39 [2022-04-15 05:41:44,445 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 05:41:44,445 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-15 05:41:44,446 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:44,447 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 21 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 05:41:44,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-04-15 05:41:44,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:44,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,464 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,464 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,467 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 05:41:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 05:41:44,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:44,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:44,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 05:41:44,469 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 05:41:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,470 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 05:41:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 05:41:44,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:44,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:44,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:44,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-15 05:41:44,475 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2022-04-15 05:41:44,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:44,475 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-15 05:41:44,476 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 27 transitions. [2022-04-15 05:41:44,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:44,499 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-15 05:41:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 05:41:44,503 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:44,503 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:44,525 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-15 05:41:44,715 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 05:41:44,716 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:44,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:44,716 INFO L85 PathProgramCache]: Analyzing trace with hash -436810175, now seen corresponding path program 5 times [2022-04-15 05:41:44,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:44,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [60359259] [2022-04-15 05:41:44,730 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:44,730 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:44,730 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:44,730 INFO L85 PathProgramCache]: Analyzing trace with hash -436810175, now seen corresponding path program 6 times [2022-04-15 05:41:44,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:44,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633075636] [2022-04-15 05:41:44,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:44,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:44,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:44,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {889#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {880#true} is VALID [2022-04-15 05:41:44,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-15 05:41:44,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {880#true} {880#true} #43#return; {880#true} is VALID [2022-04-15 05:41:44,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {889#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:44,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {889#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {880#true} is VALID [2022-04-15 05:41:44,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-15 05:41:44,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} #43#return; {880#true} is VALID [2022-04-15 05:41:44,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {880#true} is VALID [2022-04-15 05:41:44,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {885#(= main_~i~0 0)} is VALID [2022-04-15 05:41:44,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {885#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {885#(= main_~i~0 0)} is VALID [2022-04-15 05:41:44,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {885#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:44,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:44,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:44,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:44,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {888#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:44,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {888#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 3))} assume !(~i~0 % 4294967296 < 102400); {881#false} is VALID [2022-04-15 05:41:44,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {881#false} ~i~0 := 0; {881#false} is VALID [2022-04-15 05:41:44,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-15 05:41:44,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-15 05:41:44,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-15 05:41:44,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-15 05:41:44,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-15 05:41:44,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-15 05:41:44,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-15 05:41:44,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-15 05:41:44,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-15 05:41:44,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {881#false} assume !(~i~0 % 4294967296 < 102400); {881#false} is VALID [2022-04-15 05:41:44,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-04-15 05:41:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 05:41:44,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:44,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633075636] [2022-04-15 05:41:44,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633075636] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:44,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876963164] [2022-04-15 05:41:44,863 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:41:44,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:44,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:44,864 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-15 05:41:44,865 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-15 05:41:44,931 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 05:41:44,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:44,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 05:41:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:44,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:45,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {880#true} is VALID [2022-04-15 05:41:45,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {880#true} is VALID [2022-04-15 05:41:45,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-15 05:41:45,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} #43#return; {880#true} is VALID [2022-04-15 05:41:45,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {880#true} is VALID [2022-04-15 05:41:45,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {885#(= main_~i~0 0)} is VALID [2022-04-15 05:41:45,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {885#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {885#(= main_~i~0 0)} is VALID [2022-04-15 05:41:45,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {885#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:45,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:45,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:45,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:45,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {926#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:45,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {926#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(~i~0 % 4294967296 < 102400); {881#false} is VALID [2022-04-15 05:41:45,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {881#false} ~i~0 := 0; {881#false} is VALID [2022-04-15 05:41:45,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-15 05:41:45,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-15 05:41:45,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-15 05:41:45,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-15 05:41:45,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-15 05:41:45,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-15 05:41:45,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-15 05:41:45,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-15 05:41:45,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-15 05:41:45,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {881#false} assume !(~i~0 % 4294967296 < 102400); {881#false} is VALID [2022-04-15 05:41:45,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-04-15 05:41:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 05:41:45,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:45,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-04-15 05:41:45,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {881#false} assume !(~i~0 % 4294967296 < 102400); {881#false} is VALID [2022-04-15 05:41:45,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-15 05:41:45,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-15 05:41:45,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-15 05:41:45,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-15 05:41:45,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-15 05:41:45,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-15 05:41:45,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-15 05:41:45,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-15 05:41:45,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {881#false} is VALID [2022-04-15 05:41:45,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {881#false} ~i~0 := 0; {881#false} is VALID [2022-04-15 05:41:45,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {1002#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {881#false} is VALID [2022-04-15 05:41:45,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {1006#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1002#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:41:45,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {1006#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1006#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:45,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {1013#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1006#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:45,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {1013#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1013#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:45,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {1020#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1013#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:45,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {1020#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1020#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:45,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1020#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:45,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {880#true} is VALID [2022-04-15 05:41:45,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} #43#return; {880#true} is VALID [2022-04-15 05:41:45,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-15 05:41:45,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {880#true} is VALID [2022-04-15 05:41:45,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {880#true} is VALID [2022-04-15 05:41:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 05:41:45,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876963164] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:45,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:45,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 05:41:45,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:45,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [60359259] [2022-04-15 05:41:45,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [60359259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:45,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:45,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:41:45,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650334444] [2022-04-15 05:41:45,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:45,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 05:41:45,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:45,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:45,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:45,267 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:41:45,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:45,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:41:45,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-15 05:41:45,268 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:45,410 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-15 05:41:45,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:41:45,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 05:41:45,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 05:41:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 05:41:45,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-15 05:41:45,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:45,440 INFO L225 Difference]: With dead ends: 47 [2022-04-15 05:41:45,440 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 05:41:45,441 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-04-15 05:41:45,441 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:45,441 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 31 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:41:45,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 05:41:45,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-15 05:41:45,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:45,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:45,457 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:45,457 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:45,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:45,458 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-15 05:41:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-15 05:41:45,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:45,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:45,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 05:41:45,459 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 05:41:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:45,459 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-15 05:41:45,459 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-15 05:41:45,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:45,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:45,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:45,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-15 05:41:45,460 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2022-04-15 05:41:45,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:45,461 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-15 05:41:45,461 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:45,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2022-04-15 05:41:45,481 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-15 05:41:45,481 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-15 05:41:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 05:41:45,482 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:45,482 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:45,503 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-15 05:41:45,695 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-15 05:41:45,695 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:45,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash 329033496, now seen corresponding path program 7 times [2022-04-15 05:41:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:45,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [584221255] [2022-04-15 05:41:45,706 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:45,706 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:45,706 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:45,706 INFO L85 PathProgramCache]: Analyzing trace with hash 329033496, now seen corresponding path program 8 times [2022-04-15 05:41:45,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:45,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127653502] [2022-04-15 05:41:45,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:45,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:45,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:45,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {1280#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1270#true} is VALID [2022-04-15 05:41:45,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-15 05:41:45,818 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1270#true} {1270#true} #43#return; {1270#true} is VALID [2022-04-15 05:41:45,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1280#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:45,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {1280#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1270#true} is VALID [2022-04-15 05:41:45,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-15 05:41:45,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1270#true} {1270#true} #43#return; {1270#true} is VALID [2022-04-15 05:41:45,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {1270#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1270#true} is VALID [2022-04-15 05:41:45,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {1270#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1275#(= main_~i~0 0)} is VALID [2022-04-15 05:41:45,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {1275#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1275#(= main_~i~0 0)} is VALID [2022-04-15 05:41:45,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {1275#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:45,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:45,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:45,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:45,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:45,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:45,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1279#(and (<= main_~i~0 4) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:41:45,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {1279#(and (<= main_~i~0 4) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {1271#false} is VALID [2022-04-15 05:41:45,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {1271#false} ~i~0 := 0; {1271#false} is VALID [2022-04-15 05:41:45,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {1271#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1271#false} is VALID [2022-04-15 05:41:45,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {1271#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1271#false} is VALID [2022-04-15 05:41:45,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {1271#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1271#false} is VALID [2022-04-15 05:41:45,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {1271#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1271#false} is VALID [2022-04-15 05:41:45,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {1271#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1271#false} is VALID [2022-04-15 05:41:45,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {1271#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1271#false} is VALID [2022-04-15 05:41:45,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {1271#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1271#false} is VALID [2022-04-15 05:41:45,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {1271#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1271#false} is VALID [2022-04-15 05:41:45,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {1271#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1271#false} is VALID [2022-04-15 05:41:45,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {1271#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1271#false} is VALID [2022-04-15 05:41:45,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {1271#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1271#false} is VALID [2022-04-15 05:41:45,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {1271#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1271#false} is VALID [2022-04-15 05:41:45,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {1271#false} assume !(~i~0 % 4294967296 < 102400); {1271#false} is VALID [2022-04-15 05:41:45,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2022-04-15 05:41:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-15 05:41:45,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:45,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127653502] [2022-04-15 05:41:45,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127653502] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:45,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979018129] [2022-04-15 05:41:45,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:45,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:45,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:45,829 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-15 05:41:45,830 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-15 05:41:45,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:41:45,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:45,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 05:41:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:45,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:46,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1270#true} is VALID [2022-04-15 05:41:46,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1270#true} is VALID [2022-04-15 05:41:46,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-15 05:41:46,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1270#true} {1270#true} #43#return; {1270#true} is VALID [2022-04-15 05:41:46,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {1270#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1270#true} is VALID [2022-04-15 05:41:46,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {1270#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1270#true} is VALID [2022-04-15 05:41:46,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-15 05:41:46,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-15 05:41:46,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-15 05:41:46,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-15 05:41:46,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-15 05:41:46,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-15 05:41:46,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-15 05:41:46,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-15 05:41:46,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {1270#true} assume !(~i~0 % 4294967296 < 102400); {1270#true} is VALID [2022-04-15 05:41:46,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {1270#true} ~i~0 := 0; {1275#(= main_~i~0 0)} is VALID [2022-04-15 05:41:46,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {1275#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1275#(= main_~i~0 0)} is VALID [2022-04-15 05:41:46,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {1275#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1275#(= main_~i~0 0)} is VALID [2022-04-15 05:41:46,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {1275#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:46,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:46,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:46,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:46,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:46,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:46,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:46,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:46,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:46,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1365#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:46,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {1365#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {1271#false} is VALID [2022-04-15 05:41:46,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2022-04-15 05:41:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 05:41:46,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:46,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2022-04-15 05:41:46,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {1375#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {1271#false} is VALID [2022-04-15 05:41:46,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1375#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:41:46,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:46,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:46,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:46,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:46,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:46,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:46,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:46,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:46,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:46,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:46,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:46,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {1270#true} ~i~0 := 0; {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:46,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {1270#true} assume !(~i~0 % 4294967296 < 102400); {1270#true} is VALID [2022-04-15 05:41:46,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-15 05:41:46,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-15 05:41:46,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-15 05:41:46,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-15 05:41:46,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-15 05:41:46,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-15 05:41:46,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-15 05:41:46,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-15 05:41:46,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {1270#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1270#true} is VALID [2022-04-15 05:41:46,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {1270#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1270#true} is VALID [2022-04-15 05:41:46,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1270#true} {1270#true} #43#return; {1270#true} is VALID [2022-04-15 05:41:46,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-15 05:41:46,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1270#true} is VALID [2022-04-15 05:41:46,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1270#true} is VALID [2022-04-15 05:41:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 05:41:46,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979018129] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:46,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:46,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 05:41:46,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:46,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [584221255] [2022-04-15 05:41:46,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [584221255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:46,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:46,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:41:46,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889793132] [2022-04-15 05:41:46,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:46,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 05:41:46,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:46,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:46,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:46,282 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:41:46,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:46,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:41:46,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-15 05:41:46,283 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:46,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:46,489 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-04-15 05:41:46,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:41:46,490 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 05:41:46,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-15 05:41:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-15 05:41:46,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 48 transitions. [2022-04-15 05:41:46,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:46,521 INFO L225 Difference]: With dead ends: 55 [2022-04-15 05:41:46,521 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 05:41:46,521 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-04-15 05:41:46,522 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:46,522 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:41:46,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 05:41:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-04-15 05:41:46,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:46,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:46,538 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:46,538 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:46,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:46,539 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-15 05:41:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-15 05:41:46,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:46,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:46,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 05:41:46,540 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 05:41:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:46,541 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-15 05:41:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-15 05:41:46,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:46,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:46,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:46,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-04-15 05:41:46,542 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2022-04-15 05:41:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:46,542 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-04-15 05:41:46,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:46,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 37 transitions. [2022-04-15 05:41:46,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-04-15 05:41:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 05:41:46,564 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:46,564 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:46,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 05:41:46,765 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:46,765 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:46,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:46,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1926970717, now seen corresponding path program 9 times [2022-04-15 05:41:46,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:46,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1939075359] [2022-04-15 05:41:46,778 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:46,778 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:46,778 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:46,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1926970717, now seen corresponding path program 10 times [2022-04-15 05:41:46,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:46,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370953791] [2022-04-15 05:41:46,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:46,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:46,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:46,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {1739#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1728#true} is VALID [2022-04-15 05:41:46,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {1728#true} assume true; {1728#true} is VALID [2022-04-15 05:41:46,887 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1728#true} {1728#true} #43#return; {1728#true} is VALID [2022-04-15 05:41:46,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {1728#true} call ULTIMATE.init(); {1739#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:46,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {1739#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1728#true} is VALID [2022-04-15 05:41:46,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {1728#true} assume true; {1728#true} is VALID [2022-04-15 05:41:46,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1728#true} {1728#true} #43#return; {1728#true} is VALID [2022-04-15 05:41:46,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {1728#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1728#true} is VALID [2022-04-15 05:41:46,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {1728#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1733#(= main_~i~0 0)} is VALID [2022-04-15 05:41:46,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {1733#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1733#(= main_~i~0 0)} is VALID [2022-04-15 05:41:46,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {1733#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:46,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:46,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:46,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:46,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:46,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:46,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:46,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:46,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1738#(and (<= main_~i~0 5) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:41:46,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {1738#(and (<= main_~i~0 5) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {1729#false} is VALID [2022-04-15 05:41:46,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {1729#false} ~i~0 := 0; {1729#false} is VALID [2022-04-15 05:41:46,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-15 05:41:46,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 05:41:46,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 05:41:46,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-15 05:41:46,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 05:41:46,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 05:41:46,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-15 05:41:46,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 05:41:46,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 05:41:46,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-15 05:41:46,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 05:41:46,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 05:41:46,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-15 05:41:46,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 05:41:46,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 05:41:46,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {1729#false} assume !(~i~0 % 4294967296 < 102400); {1729#false} is VALID [2022-04-15 05:41:46,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {1729#false} assume !false; {1729#false} is VALID [2022-04-15 05:41:46,895 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-15 05:41:46,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:46,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370953791] [2022-04-15 05:41:46,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370953791] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:46,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736260823] [2022-04-15 05:41:46,895 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:41:46,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:46,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:46,896 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-15 05:41:46,897 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-15 05:41:46,949 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:41:46,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:46,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 05:41:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:46,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:47,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {1728#true} call ULTIMATE.init(); {1728#true} is VALID [2022-04-15 05:41:47,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {1728#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1728#true} is VALID [2022-04-15 05:41:47,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {1728#true} assume true; {1728#true} is VALID [2022-04-15 05:41:47,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1728#true} {1728#true} #43#return; {1728#true} is VALID [2022-04-15 05:41:47,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {1728#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1728#true} is VALID [2022-04-15 05:41:47,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {1728#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1733#(= main_~i~0 0)} is VALID [2022-04-15 05:41:47,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {1733#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1733#(= main_~i~0 0)} is VALID [2022-04-15 05:41:47,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {1733#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:47,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:47,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:47,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:47,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:47,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:47,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:47,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:47,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1788#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:47,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {1788#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {1729#false} is VALID [2022-04-15 05:41:47,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {1729#false} ~i~0 := 0; {1729#false} is VALID [2022-04-15 05:41:47,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-15 05:41:47,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 05:41:47,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 05:41:47,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-15 05:41:47,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 05:41:47,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 05:41:47,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-15 05:41:47,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 05:41:47,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 05:41:47,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-15 05:41:47,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 05:41:47,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 05:41:47,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-15 05:41:47,173 INFO L290 TraceCheckUtils]: 31: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 05:41:47,173 INFO L290 TraceCheckUtils]: 32: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 05:41:47,173 INFO L290 TraceCheckUtils]: 33: Hoare triple {1729#false} assume !(~i~0 % 4294967296 < 102400); {1729#false} is VALID [2022-04-15 05:41:47,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {1729#false} assume !false; {1729#false} is VALID [2022-04-15 05:41:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-15 05:41:47,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:47,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {1729#false} assume !false; {1729#false} is VALID [2022-04-15 05:41:47,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {1729#false} assume !(~i~0 % 4294967296 < 102400); {1729#false} is VALID [2022-04-15 05:41:47,336 INFO L290 TraceCheckUtils]: 32: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 05:41:47,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 05:41:47,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-15 05:41:47,336 INFO L290 TraceCheckUtils]: 29: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 05:41:47,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 05:41:47,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-15 05:41:47,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 05:41:47,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 05:41:47,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-15 05:41:47,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 05:41:47,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 05:41:47,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-15 05:41:47,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 05:41:47,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 05:41:47,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1729#false} is VALID [2022-04-15 05:41:47,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {1729#false} ~i~0 := 0; {1729#false} is VALID [2022-04-15 05:41:47,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {1900#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {1729#false} is VALID [2022-04-15 05:41:47,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {1904#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1900#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:41:47,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {1904#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1904#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:47,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {1911#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1904#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:47,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {1911#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1911#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:47,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {1918#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1911#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:47,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {1918#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1918#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:47,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1918#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:47,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1925#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:47,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {1932#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1925#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:47,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {1932#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {1932#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:47,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {1728#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1932#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:47,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {1728#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1728#true} is VALID [2022-04-15 05:41:47,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1728#true} {1728#true} #43#return; {1728#true} is VALID [2022-04-15 05:41:47,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {1728#true} assume true; {1728#true} is VALID [2022-04-15 05:41:47,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {1728#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1728#true} is VALID [2022-04-15 05:41:47,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {1728#true} call ULTIMATE.init(); {1728#true} is VALID [2022-04-15 05:41:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-15 05:41:47,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736260823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:47,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:47,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-15 05:41:47,349 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:47,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1939075359] [2022-04-15 05:41:47,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1939075359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:47,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:47,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:41:47,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089892622] [2022-04-15 05:41:47,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:47,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 05:41:47,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:47,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,364 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-15 05:41:47,364 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:41:47,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:47,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:41:47,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-04-15 05:41:47,365 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:47,639 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-04-15 05:41:47,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:41:47,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 05:41:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-04-15 05:41:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-04-15 05:41:47,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2022-04-15 05:41:47,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:47,672 INFO L225 Difference]: With dead ends: 63 [2022-04-15 05:41:47,672 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 05:41:47,673 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-04-15 05:41:47,673 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:47,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 42 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:41:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 05:41:47,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2022-04-15 05:41:47,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:47,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,711 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,711 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:47,712 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-04-15 05:41:47,712 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2022-04-15 05:41:47,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:47,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:47,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 05:41:47,713 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 05:41:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:47,713 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-04-15 05:41:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2022-04-15 05:41:47,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:47,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:47,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:47,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:47,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2022-04-15 05:41:47,715 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2022-04-15 05:41:47,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:47,715 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2022-04-15 05:41:47,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 42 transitions. [2022-04-15 05:41:47,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 05:41:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 05:41:47,743 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:47,743 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:47,759 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-15 05:41:47,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:47,960 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:47,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:47,960 INFO L85 PathProgramCache]: Analyzing trace with hash 261275644, now seen corresponding path program 11 times [2022-04-15 05:41:47,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:47,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1664255966] [2022-04-15 05:41:47,969 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:47,969 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:47,969 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:47,969 INFO L85 PathProgramCache]: Analyzing trace with hash 261275644, now seen corresponding path program 12 times [2022-04-15 05:41:47,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:47,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110620820] [2022-04-15 05:41:47,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:47,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:48,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:48,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {2266#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2254#true} is VALID [2022-04-15 05:41:48,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-15 05:41:48,128 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2254#true} {2254#true} #43#return; {2254#true} is VALID [2022-04-15 05:41:48,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {2254#true} call ULTIMATE.init(); {2266#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:48,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {2266#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2254#true} is VALID [2022-04-15 05:41:48,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-15 05:41:48,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2254#true} {2254#true} #43#return; {2254#true} is VALID [2022-04-15 05:41:48,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {2254#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2254#true} is VALID [2022-04-15 05:41:48,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {2254#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {2259#(= main_~i~0 0)} is VALID [2022-04-15 05:41:48,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {2259#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2259#(= main_~i~0 0)} is VALID [2022-04-15 05:41:48,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {2259#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:48,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:48,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:48,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:48,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:48,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:48,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:48,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:48,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:48,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:48,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2265#(and (<= main_~i~0 6) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:41:48,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {2265#(and (<= main_~i~0 6) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {2255#false} is VALID [2022-04-15 05:41:48,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {2255#false} ~i~0 := 0; {2255#false} is VALID [2022-04-15 05:41:48,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2255#false} is VALID [2022-04-15 05:41:48,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 05:41:48,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 05:41:48,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2255#false} is VALID [2022-04-15 05:41:48,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 05:41:48,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 05:41:48,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2255#false} is VALID [2022-04-15 05:41:48,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 05:41:48,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 05:41:48,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2255#false} is VALID [2022-04-15 05:41:48,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 05:41:48,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 05:41:48,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2255#false} is VALID [2022-04-15 05:41:48,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 05:41:48,135 INFO L290 TraceCheckUtils]: 34: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 05:41:48,136 INFO L290 TraceCheckUtils]: 35: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2255#false} is VALID [2022-04-15 05:41:48,136 INFO L290 TraceCheckUtils]: 36: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 05:41:48,136 INFO L290 TraceCheckUtils]: 37: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 05:41:48,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {2255#false} assume !(~i~0 % 4294967296 < 102400); {2255#false} is VALID [2022-04-15 05:41:48,136 INFO L290 TraceCheckUtils]: 39: Hoare triple {2255#false} assume !false; {2255#false} is VALID [2022-04-15 05:41:48,136 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-15 05:41:48,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:48,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110620820] [2022-04-15 05:41:48,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110620820] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:48,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881112341] [2022-04-15 05:41:48,136 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:41:48,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:48,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:48,137 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-15 05:41:48,138 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-15 05:41:48,433 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 05:41:48,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:48,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 05:41:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:48,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:49,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {2254#true} call ULTIMATE.init(); {2254#true} is VALID [2022-04-15 05:41:49,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {2254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2254#true} is VALID [2022-04-15 05:41:49,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-15 05:41:49,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2254#true} {2254#true} #43#return; {2254#true} is VALID [2022-04-15 05:41:49,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {2254#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2254#true} is VALID [2022-04-15 05:41:49,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {2254#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {2259#(= main_~i~0 0)} is VALID [2022-04-15 05:41:49,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {2259#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2259#(= main_~i~0 0)} is VALID [2022-04-15 05:41:49,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {2259#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:49,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:49,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:49,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:49,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:49,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:49,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:49,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2254#true} is VALID [2022-04-15 05:41:49,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {2254#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2254#true} is VALID [2022-04-15 05:41:49,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {2254#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2318#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:41:49,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {2318#(< (mod main_~i~0 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2322#(< (mod (+ main_~i~0 4294967295) 4294967296) 102400)} is VALID [2022-04-15 05:41:49,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {2322#(< (mod (+ main_~i~0 4294967295) 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {2254#true} is VALID [2022-04-15 05:41:49,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {2254#true} ~i~0 := 0; {2259#(= main_~i~0 0)} is VALID [2022-04-15 05:41:49,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {2259#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2259#(= main_~i~0 0)} is VALID [2022-04-15 05:41:49,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {2259#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2259#(= main_~i~0 0)} is VALID [2022-04-15 05:41:49,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {2259#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:49,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:49,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:49,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:49,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:49,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:49,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:49,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:49,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:49,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:49,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:49,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:49,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:49,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:49,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:49,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2383#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:49,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {2383#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {2255#false} is VALID [2022-04-15 05:41:49,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {2255#false} assume !false; {2255#false} is VALID [2022-04-15 05:41:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 2 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:41:49,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:49,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {2255#false} assume !false; {2255#false} is VALID [2022-04-15 05:41:49,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {2318#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {2255#false} is VALID [2022-04-15 05:41:49,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {2396#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2318#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:41:49,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {2396#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2396#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:49,529 INFO L290 TraceCheckUtils]: 35: Hoare triple {2403#(or (not (< (mod main_~i~0 4294967296) 102400)) (< (mod (+ main_~i~0 1) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2396#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:49,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {2407#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2403#(or (not (< (mod main_~i~0 4294967296) 102400)) (< (mod (+ main_~i~0 1) 4294967296) 102400))} is VALID [2022-04-15 05:41:49,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {2407#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2407#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} is VALID [2022-04-15 05:41:49,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {2407#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2407#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} is VALID [2022-04-15 05:41:49,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {2417#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2407#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} is VALID [2022-04-15 05:41:49,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {2417#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2417#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} is VALID [2022-04-15 05:41:49,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {2417#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2417#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} is VALID [2022-04-15 05:41:49,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {2427#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2417#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} is VALID [2022-04-15 05:41:49,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {2427#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2427#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} is VALID [2022-04-15 05:41:49,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {2427#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2427#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} is VALID [2022-04-15 05:41:49,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {2437#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2427#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} is VALID [2022-04-15 05:41:49,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {2437#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2437#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} is VALID [2022-04-15 05:41:49,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {2437#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2437#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} is VALID [2022-04-15 05:41:49,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {2447#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2437#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} is VALID [2022-04-15 05:41:49,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {2447#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2447#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} is VALID [2022-04-15 05:41:49,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {2447#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2447#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} is VALID [2022-04-15 05:41:49,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {2254#true} ~i~0 := 0; {2447#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} is VALID [2022-04-15 05:41:49,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {2254#true} assume !(~i~0 % 4294967296 < 102400); {2254#true} is VALID [2022-04-15 05:41:49,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {2254#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2254#true} is VALID [2022-04-15 05:41:49,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {2254#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2254#true} is VALID [2022-04-15 05:41:49,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {2254#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2254#true} is VALID [2022-04-15 05:41:49,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {2254#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2254#true} is VALID [2022-04-15 05:41:49,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {2254#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2254#true} is VALID [2022-04-15 05:41:49,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {2254#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2254#true} is VALID [2022-04-15 05:41:49,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {2254#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2254#true} is VALID [2022-04-15 05:41:49,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {2254#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2254#true} is VALID [2022-04-15 05:41:49,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {2254#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2254#true} is VALID [2022-04-15 05:41:49,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {2254#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2254#true} is VALID [2022-04-15 05:41:49,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {2254#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2254#true} is VALID [2022-04-15 05:41:49,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {2254#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2254#true} is VALID [2022-04-15 05:41:49,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {2254#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {2254#true} is VALID [2022-04-15 05:41:49,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {2254#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2254#true} is VALID [2022-04-15 05:41:49,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2254#true} {2254#true} #43#return; {2254#true} is VALID [2022-04-15 05:41:49,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-15 05:41:49,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {2254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2254#true} is VALID [2022-04-15 05:41:49,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {2254#true} call ULTIMATE.init(); {2254#true} is VALID [2022-04-15 05:41:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-15 05:41:49,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881112341] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:49,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:49,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 20 [2022-04-15 05:41:49,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:49,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1664255966] [2022-04-15 05:41:49,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1664255966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:49,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:49,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 05:41:49,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485101146] [2022-04-15 05:41:49,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:49,547 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 05:41:49,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:49,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:49,566 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-15 05:41:49,566 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 05:41:49,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:49,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 05:41:49,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-04-15 05:41:49,567 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:49,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:49,908 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-15 05:41:49,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 05:41:49,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 05:41:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-15 05:41:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-15 05:41:49,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-15 05:41:49,948 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-15 05:41:49,949 INFO L225 Difference]: With dead ends: 71 [2022-04-15 05:41:49,949 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 05:41:49,950 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2022-04-15 05:41:49,950 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:49,950 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 73 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:41:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 05:41:49,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2022-04-15 05:41:49,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:49,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:49,979 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:49,980 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:49,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:49,980 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-04-15 05:41:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-15 05:41:49,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:49,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:49,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 05:41:49,981 INFO L87 Difference]: Start difference. First operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 05:41:49,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:49,982 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-04-15 05:41:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-15 05:41:49,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:49,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:49,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:49,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:49,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2022-04-15 05:41:49,983 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2022-04-15 05:41:49,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:49,983 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2022-04-15 05:41:49,983 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:49,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 47 transitions. [2022-04-15 05:41:50,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2022-04-15 05:41:50,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 05:41:50,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:50,016 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:50,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 05:41:50,220 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:50,220 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:50,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:50,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1323430791, now seen corresponding path program 13 times [2022-04-15 05:41:50,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:50,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2017137016] [2022-04-15 05:41:50,229 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:50,229 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:50,229 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:50,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1323430791, now seen corresponding path program 14 times [2022-04-15 05:41:50,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:50,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158031337] [2022-04-15 05:41:50,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:50,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:50,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:50,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {2863#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2850#true} is VALID [2022-04-15 05:41:50,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {2850#true} assume true; {2850#true} is VALID [2022-04-15 05:41:50,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2850#true} {2850#true} #43#return; {2850#true} is VALID [2022-04-15 05:41:50,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {2850#true} call ULTIMATE.init(); {2863#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:50,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {2863#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2850#true} is VALID [2022-04-15 05:41:50,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {2850#true} assume true; {2850#true} is VALID [2022-04-15 05:41:50,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2850#true} {2850#true} #43#return; {2850#true} is VALID [2022-04-15 05:41:50,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {2850#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2850#true} is VALID [2022-04-15 05:41:50,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {2850#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {2855#(= main_~i~0 0)} is VALID [2022-04-15 05:41:50,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {2855#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2855#(= main_~i~0 0)} is VALID [2022-04-15 05:41:50,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {2855#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:50,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:50,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:50,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:50,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:50,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:50,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:50,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:50,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:50,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:50,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:50,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:50,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2862#(and (<= main_~i~0 7) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:41:50,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {2862#(and (<= main_~i~0 7) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {2851#false} is VALID [2022-04-15 05:41:50,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {2851#false} ~i~0 := 0; {2851#false} is VALID [2022-04-15 05:41:50,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {2851#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2851#false} is VALID [2022-04-15 05:41:50,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {2851#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2851#false} is VALID [2022-04-15 05:41:50,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {2851#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2851#false} is VALID [2022-04-15 05:41:50,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {2851#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2851#false} is VALID [2022-04-15 05:41:50,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {2851#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2851#false} is VALID [2022-04-15 05:41:50,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {2851#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {2851#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {2851#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {2851#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {2851#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {2851#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {2851#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {2851#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {2851#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {2851#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {2851#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {2851#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {2851#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {2851#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {2851#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {2851#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {2851#false} assume !(~i~0 % 4294967296 < 102400); {2851#false} is VALID [2022-04-15 05:41:50,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {2851#false} assume !false; {2851#false} is VALID [2022-04-15 05:41:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-15 05:41:50,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:50,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158031337] [2022-04-15 05:41:50,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158031337] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:50,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771883934] [2022-04-15 05:41:50,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:50,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:50,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:50,370 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-15 05:41:50,371 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-15 05:41:50,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:41:50,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:50,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 05:41:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:50,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:50,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {2850#true} call ULTIMATE.init(); {2850#true} is VALID [2022-04-15 05:41:50,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {2850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2850#true} is VALID [2022-04-15 05:41:50,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {2850#true} assume true; {2850#true} is VALID [2022-04-15 05:41:50,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2850#true} {2850#true} #43#return; {2850#true} is VALID [2022-04-15 05:41:50,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {2850#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2850#true} is VALID [2022-04-15 05:41:50,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {2850#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {2850#true} is VALID [2022-04-15 05:41:50,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-15 05:41:50,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-15 05:41:50,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-15 05:41:50,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-15 05:41:50,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-15 05:41:50,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-15 05:41:50,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-15 05:41:50,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-15 05:41:50,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-15 05:41:50,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-15 05:41:50,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-15 05:41:50,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-15 05:41:50,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-15 05:41:50,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-15 05:41:50,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {2850#true} assume !(~i~0 % 4294967296 < 102400); {2850#true} is VALID [2022-04-15 05:41:50,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {2850#true} ~i~0 := 0; {2855#(= main_~i~0 0)} is VALID [2022-04-15 05:41:50,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {2855#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2855#(= main_~i~0 0)} is VALID [2022-04-15 05:41:50,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {2855#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2855#(= main_~i~0 0)} is VALID [2022-04-15 05:41:50,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {2855#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:50,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:50,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:50,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {2856#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:50,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:50,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:50,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {2857#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:50,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:50,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:50,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {2858#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:50,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:50,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:50,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {2859#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:50,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:50,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:50,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {2860#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:50,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:50,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:50,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {2861#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2993#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:50,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {2993#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {2851#false} is VALID [2022-04-15 05:41:50,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {2851#false} assume !false; {2851#false} is VALID [2022-04-15 05:41:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-15 05:41:50,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:51,003 INFO L290 TraceCheckUtils]: 44: Hoare triple {2851#false} assume !false; {2851#false} is VALID [2022-04-15 05:41:51,004 INFO L290 TraceCheckUtils]: 43: Hoare triple {3003#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {2851#false} is VALID [2022-04-15 05:41:51,004 INFO L290 TraceCheckUtils]: 42: Hoare triple {3007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3003#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:41:51,005 INFO L290 TraceCheckUtils]: 41: Hoare triple {3007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,005 INFO L290 TraceCheckUtils]: 40: Hoare triple {3007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {3017#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {3017#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3017#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {3017#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3017#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {3027#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3017#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {3027#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3027#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {3027#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3027#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,008 INFO L290 TraceCheckUtils]: 33: Hoare triple {3037#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3027#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {3037#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3037#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {3037#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3037#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {3047#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3037#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {3047#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3047#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {3047#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3047#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {3057#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3047#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {3057#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3057#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {3057#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3057#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {3067#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3057#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {3067#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3067#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {3067#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3067#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {2850#true} ~i~0 := 0; {3067#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:51,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {2850#true} assume !(~i~0 % 4294967296 < 102400); {2850#true} is VALID [2022-04-15 05:41:51,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-15 05:41:51,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-15 05:41:51,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-15 05:41:51,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-15 05:41:51,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-15 05:41:51,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-15 05:41:51,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-15 05:41:51,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-15 05:41:51,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-15 05:41:51,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-15 05:41:51,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-15 05:41:51,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-15 05:41:51,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {2850#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2850#true} is VALID [2022-04-15 05:41:51,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {2850#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2850#true} is VALID [2022-04-15 05:41:51,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {2850#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {2850#true} is VALID [2022-04-15 05:41:51,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {2850#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2850#true} is VALID [2022-04-15 05:41:51,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2850#true} {2850#true} #43#return; {2850#true} is VALID [2022-04-15 05:41:51,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {2850#true} assume true; {2850#true} is VALID [2022-04-15 05:41:51,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {2850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2850#true} is VALID [2022-04-15 05:41:51,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {2850#true} call ULTIMATE.init(); {2850#true} is VALID [2022-04-15 05:41:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-15 05:41:51,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771883934] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:51,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:51,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-15 05:41:51,015 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:51,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2017137016] [2022-04-15 05:41:51,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2017137016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:51,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:51,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 05:41:51,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789929626] [2022-04-15 05:41:51,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:51,016 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 05:41:51,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:51,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:51,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:51,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 05:41:51,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:51,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 05:41:51,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-04-15 05:41:51,047 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:51,556 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-04-15 05:41:51,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 05:41:51,556 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 05:41:51,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2022-04-15 05:41:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2022-04-15 05:41:51,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 63 transitions. [2022-04-15 05:41:51,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:51,601 INFO L225 Difference]: With dead ends: 79 [2022-04-15 05:41:51,601 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 05:41:51,602 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2022-04-15 05:41:51,602 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:51,602 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 96 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:41:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 05:41:51,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2022-04-15 05:41:51,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:51,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:51,640 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:51,641 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:51,642 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-04-15 05:41:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-04-15 05:41:51,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:51,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:51,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 05:41:51,642 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 05:41:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:51,643 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-04-15 05:41:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-04-15 05:41:51,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:51,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:51,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:51,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-04-15 05:41:51,644 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 45 [2022-04-15 05:41:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:51,644 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-04-15 05:41:51,644 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:51,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 52 transitions. [2022-04-15 05:41:51,699 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-15 05:41:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-04-15 05:41:51,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 05:41:51,700 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:51,700 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:51,716 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-15 05:41:51,913 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:51,913 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:51,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:51,914 INFO L85 PathProgramCache]: Analyzing trace with hash 416520416, now seen corresponding path program 15 times [2022-04-15 05:41:51,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:51,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [286541945] [2022-04-15 05:41:51,923 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:51,923 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:51,923 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:51,923 INFO L85 PathProgramCache]: Analyzing trace with hash 416520416, now seen corresponding path program 16 times [2022-04-15 05:41:51,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:51,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724745166] [2022-04-15 05:41:51,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:51,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:52,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:52,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {3526#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {3512#true} is VALID [2022-04-15 05:41:52,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {3512#true} assume true; {3512#true} is VALID [2022-04-15 05:41:52,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3512#true} {3512#true} #43#return; {3512#true} is VALID [2022-04-15 05:41:52,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {3512#true} call ULTIMATE.init(); {3526#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:52,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {3526#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {3512#true} is VALID [2022-04-15 05:41:52,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {3512#true} assume true; {3512#true} is VALID [2022-04-15 05:41:52,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3512#true} {3512#true} #43#return; {3512#true} is VALID [2022-04-15 05:41:52,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {3512#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {3512#true} is VALID [2022-04-15 05:41:52,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {3512#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {3517#(= main_~i~0 0)} is VALID [2022-04-15 05:41:52,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {3517#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3517#(= main_~i~0 0)} is VALID [2022-04-15 05:41:52,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {3517#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:52,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:52,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:52,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:52,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:52,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:52,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:52,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:52,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:52,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:52,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:52,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:52,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:52,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:52,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3525#(and (<= main_~i~0 8) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:41:52,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {3525#(and (<= main_~i~0 8) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {3513#false} is VALID [2022-04-15 05:41:52,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {3513#false} ~i~0 := 0; {3513#false} is VALID [2022-04-15 05:41:52,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {3513#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3513#false} is VALID [2022-04-15 05:41:52,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {3513#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3513#false} is VALID [2022-04-15 05:41:52,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {3513#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3513#false} is VALID [2022-04-15 05:41:52,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {3513#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3513#false} is VALID [2022-04-15 05:41:52,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {3513#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3513#false} is VALID [2022-04-15 05:41:52,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {3513#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3513#false} is VALID [2022-04-15 05:41:52,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {3513#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3513#false} is VALID [2022-04-15 05:41:52,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {3513#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3513#false} is VALID [2022-04-15 05:41:52,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {3513#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3513#false} is VALID [2022-04-15 05:41:52,128 INFO L290 TraceCheckUtils]: 33: Hoare triple {3513#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3513#false} is VALID [2022-04-15 05:41:52,128 INFO L290 TraceCheckUtils]: 34: Hoare triple {3513#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3513#false} is VALID [2022-04-15 05:41:52,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {3513#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3513#false} is VALID [2022-04-15 05:41:52,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {3513#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3513#false} is VALID [2022-04-15 05:41:52,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {3513#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3513#false} is VALID [2022-04-15 05:41:52,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {3513#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3513#false} is VALID [2022-04-15 05:41:52,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {3513#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3513#false} is VALID [2022-04-15 05:41:52,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {3513#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3513#false} is VALID [2022-04-15 05:41:52,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {3513#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3513#false} is VALID [2022-04-15 05:41:52,129 INFO L290 TraceCheckUtils]: 42: Hoare triple {3513#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3513#false} is VALID [2022-04-15 05:41:52,129 INFO L290 TraceCheckUtils]: 43: Hoare triple {3513#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3513#false} is VALID [2022-04-15 05:41:52,129 INFO L290 TraceCheckUtils]: 44: Hoare triple {3513#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3513#false} is VALID [2022-04-15 05:41:52,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {3513#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3513#false} is VALID [2022-04-15 05:41:52,129 INFO L290 TraceCheckUtils]: 46: Hoare triple {3513#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3513#false} is VALID [2022-04-15 05:41:52,129 INFO L290 TraceCheckUtils]: 47: Hoare triple {3513#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3513#false} is VALID [2022-04-15 05:41:52,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {3513#false} assume !(~i~0 % 4294967296 < 102400); {3513#false} is VALID [2022-04-15 05:41:52,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {3513#false} assume !false; {3513#false} is VALID [2022-04-15 05:41:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-15 05:41:52,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:52,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724745166] [2022-04-15 05:41:52,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724745166] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:52,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405547594] [2022-04-15 05:41:52,130 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:41:52,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:52,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:52,144 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-15 05:41:52,199 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-15 05:41:52,281 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:41:52,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:52,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 05:41:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:52,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:52,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {3512#true} call ULTIMATE.init(); {3512#true} is VALID [2022-04-15 05:41:52,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {3512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {3512#true} is VALID [2022-04-15 05:41:52,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {3512#true} assume true; {3512#true} is VALID [2022-04-15 05:41:52,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3512#true} {3512#true} #43#return; {3512#true} is VALID [2022-04-15 05:41:52,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {3512#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {3512#true} is VALID [2022-04-15 05:41:52,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {3512#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {3512#true} is VALID [2022-04-15 05:41:52,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-15 05:41:52,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-15 05:41:52,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-15 05:41:52,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-15 05:41:52,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-15 05:41:52,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-15 05:41:52,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-15 05:41:52,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-15 05:41:52,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-15 05:41:52,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-15 05:41:52,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-15 05:41:52,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-15 05:41:52,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-15 05:41:52,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-15 05:41:52,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-15 05:41:52,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-15 05:41:52,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {3512#true} assume !(~i~0 % 4294967296 < 102400); {3512#true} is VALID [2022-04-15 05:41:52,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {3512#true} ~i~0 := 0; {3517#(= main_~i~0 0)} is VALID [2022-04-15 05:41:52,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {3517#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3517#(= main_~i~0 0)} is VALID [2022-04-15 05:41:52,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {3517#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3517#(= main_~i~0 0)} is VALID [2022-04-15 05:41:52,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {3517#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:52,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:52,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:52,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {3518#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:52,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:52,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:52,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {3519#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:52,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:52,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:52,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {3520#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:52,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:52,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:52,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {3521#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:52,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:52,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:52,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {3522#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:52,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:52,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:52,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {3523#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:52,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:52,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:52,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {3524#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3671#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:41:52,622 INFO L290 TraceCheckUtils]: 48: Hoare triple {3671#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(~i~0 % 4294967296 < 102400); {3513#false} is VALID [2022-04-15 05:41:52,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {3513#false} assume !false; {3513#false} is VALID [2022-04-15 05:41:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 05:41:52,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:52,877 INFO L290 TraceCheckUtils]: 49: Hoare triple {3513#false} assume !false; {3513#false} is VALID [2022-04-15 05:41:52,878 INFO L290 TraceCheckUtils]: 48: Hoare triple {3681#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {3513#false} is VALID [2022-04-15 05:41:52,878 INFO L290 TraceCheckUtils]: 47: Hoare triple {3685#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3681#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:41:52,879 INFO L290 TraceCheckUtils]: 46: Hoare triple {3685#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3685#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,879 INFO L290 TraceCheckUtils]: 45: Hoare triple {3685#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3685#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,880 INFO L290 TraceCheckUtils]: 44: Hoare triple {3695#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3685#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,880 INFO L290 TraceCheckUtils]: 43: Hoare triple {3695#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3695#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,880 INFO L290 TraceCheckUtils]: 42: Hoare triple {3695#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3695#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,881 INFO L290 TraceCheckUtils]: 41: Hoare triple {3705#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3695#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,881 INFO L290 TraceCheckUtils]: 40: Hoare triple {3705#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3705#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,881 INFO L290 TraceCheckUtils]: 39: Hoare triple {3705#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3705#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {3715#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3705#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {3715#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3715#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {3715#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3715#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {3725#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3715#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,883 INFO L290 TraceCheckUtils]: 34: Hoare triple {3725#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3725#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {3725#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3725#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {3735#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3725#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {3735#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3735#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {3735#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3735#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {3745#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3735#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {3745#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3745#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {3745#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3745#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {3755#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3745#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {3755#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3755#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {3755#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3755#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {3512#true} ~i~0 := 0; {3755#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:41:52,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {3512#true} assume !(~i~0 % 4294967296 < 102400); {3512#true} is VALID [2022-04-15 05:41:52,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-15 05:41:52,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-15 05:41:52,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-15 05:41:52,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-15 05:41:52,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {3512#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {3512#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {3512#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {3512#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3512#true} {3512#true} #43#return; {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {3512#true} assume true; {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {3512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {3512#true} is VALID [2022-04-15 05:41:52,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {3512#true} call ULTIMATE.init(); {3512#true} is VALID [2022-04-15 05:41:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 05:41:52,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405547594] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:52,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:52,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-15 05:41:52,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:52,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [286541945] [2022-04-15 05:41:52,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [286541945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:52,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:52,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 05:41:52,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179305268] [2022-04-15 05:41:52,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:52,890 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 05:41:52,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:52,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:52,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:52,910 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 05:41:52,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:52,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 05:41:52,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-04-15 05:41:52,911 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:53,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:53,412 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-04-15 05:41:53,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 05:41:53,412 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 05:41:53,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-04-15 05:41:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-04-15 05:41:53,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 68 transitions. [2022-04-15 05:41:53,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:53,459 INFO L225 Difference]: With dead ends: 87 [2022-04-15 05:41:53,459 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 05:41:53,459 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2022-04-15 05:41:53,460 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 39 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:53,460 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 91 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:41:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 05:41:53,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-04-15 05:41:53,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:53,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:53,512 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:53,512 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:53,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:53,513 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-04-15 05:41:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-15 05:41:53,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:53,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:53,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 05:41:53,513 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 05:41:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:53,514 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-04-15 05:41:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-15 05:41:53,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:53,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:53,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:53,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:53,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:53,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2022-04-15 05:41:53,515 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2022-04-15 05:41:53,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:53,515 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2022-04-15 05:41:53,515 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:53,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 57 transitions. [2022-04-15 05:41:53,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-04-15 05:41:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 05:41:53,555 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:53,555 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:53,572 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-15 05:41:53,768 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,SelfDestructingSolverStorable9 [2022-04-15 05:41:53,769 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:53,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:53,769 INFO L85 PathProgramCache]: Analyzing trace with hash -208864363, now seen corresponding path program 17 times [2022-04-15 05:41:53,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:53,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1018591328] [2022-04-15 05:41:53,782 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:53,782 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:53,782 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash -208864363, now seen corresponding path program 18 times [2022-04-15 05:41:53,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:53,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150041586] [2022-04-15 05:41:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:53,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:53,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:53,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {4257#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {4242#true} is VALID [2022-04-15 05:41:53,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {4242#true} assume true; {4242#true} is VALID [2022-04-15 05:41:53,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4242#true} {4242#true} #43#return; {4242#true} is VALID [2022-04-15 05:41:53,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {4242#true} call ULTIMATE.init(); {4257#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:53,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {4257#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {4242#true} is VALID [2022-04-15 05:41:53,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {4242#true} assume true; {4242#true} is VALID [2022-04-15 05:41:53,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4242#true} {4242#true} #43#return; {4242#true} is VALID [2022-04-15 05:41:53,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {4242#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {4242#true} is VALID [2022-04-15 05:41:53,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {4242#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {4247#(= main_~i~0 0)} is VALID [2022-04-15 05:41:53,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {4247#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4247#(= main_~i~0 0)} is VALID [2022-04-15 05:41:53,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {4247#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4248#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:53,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {4248#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4248#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:53,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {4248#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4249#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:53,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {4249#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4249#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:53,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {4249#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4250#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:53,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {4250#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4250#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:53,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {4250#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4251#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:53,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {4251#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4251#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:53,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {4251#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4252#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:53,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {4252#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4252#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:53,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {4252#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4253#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:53,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {4253#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4253#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:53,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {4253#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4254#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:53,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {4254#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4254#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:53,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {4254#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4255#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:41:53,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {4255#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4255#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:41:53,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {4255#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4256#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 9))} is VALID [2022-04-15 05:41:53,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {4256#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 9))} assume !(~i~0 % 4294967296 < 102400); {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {4243#false} ~i~0 := 0; {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:53,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:53,975 INFO L290 TraceCheckUtils]: 43: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:53,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:53,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:53,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:53,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:53,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:53,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:53,975 INFO L290 TraceCheckUtils]: 50: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:53,975 INFO L290 TraceCheckUtils]: 51: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:53,975 INFO L290 TraceCheckUtils]: 52: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:53,975 INFO L290 TraceCheckUtils]: 53: Hoare triple {4243#false} assume !(~i~0 % 4294967296 < 102400); {4243#false} is VALID [2022-04-15 05:41:53,975 INFO L290 TraceCheckUtils]: 54: Hoare triple {4243#false} assume !false; {4243#false} is VALID [2022-04-15 05:41:53,975 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-04-15 05:41:53,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:53,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150041586] [2022-04-15 05:41:53,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150041586] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:53,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121761259] [2022-04-15 05:41:53,976 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:41:53,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:53,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:53,977 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-15 05:41:53,991 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-15 05:41:54,750 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 05:41:54,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:54,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 05:41:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:54,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:55,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {4242#true} call ULTIMATE.init(); {4242#true} is VALID [2022-04-15 05:41:55,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {4242#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {4242#true} is VALID [2022-04-15 05:41:55,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {4242#true} assume true; {4242#true} is VALID [2022-04-15 05:41:55,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4242#true} {4242#true} #43#return; {4242#true} is VALID [2022-04-15 05:41:55,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {4242#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {4242#true} is VALID [2022-04-15 05:41:55,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {4242#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {4247#(= main_~i~0 0)} is VALID [2022-04-15 05:41:55,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {4247#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4247#(= main_~i~0 0)} is VALID [2022-04-15 05:41:55,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {4247#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4248#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:55,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {4248#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4248#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:55,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {4248#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4249#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:55,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {4249#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4249#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:55,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {4249#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4250#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:55,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {4250#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4250#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:55,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {4250#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4251#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:55,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {4251#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4251#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:55,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {4251#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4252#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:55,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {4252#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4252#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:55,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {4252#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4253#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:55,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {4253#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4253#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:55,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {4253#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4254#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:55,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {4254#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4254#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:55,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {4254#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4255#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:41:55,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {4255#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4255#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:41:55,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {4255#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4330#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:41:55,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {4330#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(~i~0 % 4294967296 < 102400); {4243#false} is VALID [2022-04-15 05:41:55,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {4243#false} ~i~0 := 0; {4243#false} is VALID [2022-04-15 05:41:55,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,082 INFO L290 TraceCheckUtils]: 30: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 35: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 36: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 40: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 41: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 42: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 43: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 44: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 45: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 46: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 47: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 48: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 49: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 50: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 51: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,083 INFO L290 TraceCheckUtils]: 52: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,084 INFO L290 TraceCheckUtils]: 53: Hoare triple {4243#false} assume !(~i~0 % 4294967296 < 102400); {4243#false} is VALID [2022-04-15 05:41:55,084 INFO L290 TraceCheckUtils]: 54: Hoare triple {4243#false} assume !false; {4243#false} is VALID [2022-04-15 05:41:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-04-15 05:41:55,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:55,370 INFO L290 TraceCheckUtils]: 54: Hoare triple {4243#false} assume !false; {4243#false} is VALID [2022-04-15 05:41:55,370 INFO L290 TraceCheckUtils]: 53: Hoare triple {4243#false} assume !(~i~0 % 4294967296 < 102400); {4243#false} is VALID [2022-04-15 05:41:55,370 INFO L290 TraceCheckUtils]: 52: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,370 INFO L290 TraceCheckUtils]: 50: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 48: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 39: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 38: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {4243#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4243#false} is VALID [2022-04-15 05:41:55,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {4243#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4243#false} is VALID [2022-04-15 05:41:55,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {4243#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4243#false} is VALID [2022-04-15 05:41:55,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {4243#false} ~i~0 := 0; {4243#false} is VALID [2022-04-15 05:41:55,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {4514#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {4243#false} is VALID [2022-04-15 05:41:55,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {4518#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4514#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:41:55,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {4518#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4518#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {4525#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4518#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {4525#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4525#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {4532#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4525#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {4532#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4532#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {4539#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4532#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {4539#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4539#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {4546#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4539#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {4546#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4546#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {4553#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4546#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {4553#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4553#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {4560#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4553#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {4560#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4560#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {4567#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4560#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {4567#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4567#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {4574#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4567#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {4574#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4574#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {4242#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {4574#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:41:55,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {4242#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {4242#true} is VALID [2022-04-15 05:41:55,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4242#true} {4242#true} #43#return; {4242#true} is VALID [2022-04-15 05:41:55,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {4242#true} assume true; {4242#true} is VALID [2022-04-15 05:41:55,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {4242#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {4242#true} is VALID [2022-04-15 05:41:55,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {4242#true} call ULTIMATE.init(); {4242#true} is VALID [2022-04-15 05:41:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-04-15 05:41:55,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121761259] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:55,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:55,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-15 05:41:55,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:55,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1018591328] [2022-04-15 05:41:55,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1018591328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:55,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:55,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 05:41:55,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875633805] [2022-04-15 05:41:55,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:55,396 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 05:41:55,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:55,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:55,417 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-15 05:41:55,417 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 05:41:55,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:55,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 05:41:55,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-04-15 05:41:55,418 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:56,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:56,052 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-04-15 05:41:56,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 05:41:56,052 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 05:41:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-15 05:41:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-15 05:41:56,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 73 transitions. [2022-04-15 05:41:56,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:56,101 INFO L225 Difference]: With dead ends: 95 [2022-04-15 05:41:56,101 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 05:41:56,102 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2022-04-15 05:41:56,102 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:56,102 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 113 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:41:56,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 05:41:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2022-04-15 05:41:56,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:56,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:56,156 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:56,156 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:56,157 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2022-04-15 05:41:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-04-15 05:41:56,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:56,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:56,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-15 05:41:56,157 INFO L87 Difference]: Start difference. First operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-15 05:41:56,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:56,158 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2022-04-15 05:41:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-04-15 05:41:56,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:56,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:56,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:56,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-04-15 05:41:56,159 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 55 [2022-04-15 05:41:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:56,159 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-04-15 05:41:56,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:56,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 62 transitions. [2022-04-15 05:41:56,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-15 05:41:56,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 05:41:56,200 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:56,200 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:56,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-15 05:41:56,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:56,401 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:56,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:56,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1999539772, now seen corresponding path program 19 times [2022-04-15 05:41:56,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:56,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1446848125] [2022-04-15 05:41:56,410 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:56,410 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:56,410 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:56,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1999539772, now seen corresponding path program 20 times [2022-04-15 05:41:56,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:56,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515962557] [2022-04-15 05:41:56,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:56,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {5056#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5040#true} is VALID [2022-04-15 05:41:56,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {5040#true} assume true; {5040#true} is VALID [2022-04-15 05:41:56,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5040#true} {5040#true} #43#return; {5040#true} is VALID [2022-04-15 05:41:56,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {5040#true} call ULTIMATE.init(); {5056#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:56,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {5056#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5040#true} is VALID [2022-04-15 05:41:56,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {5040#true} assume true; {5040#true} is VALID [2022-04-15 05:41:56,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5040#true} {5040#true} #43#return; {5040#true} is VALID [2022-04-15 05:41:56,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {5040#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5040#true} is VALID [2022-04-15 05:41:56,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {5040#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {5045#(= main_~i~0 0)} is VALID [2022-04-15 05:41:56,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {5045#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5045#(= main_~i~0 0)} is VALID [2022-04-15 05:41:56,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {5045#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:56,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:56,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:56,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:56,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:56,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:56,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:56,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:56,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:56,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:56,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:56,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:56,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:56,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:56,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:41:56,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:41:56,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:41:56,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:41:56,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5055#(and (<= main_~i~0 10) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:41:56,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {5055#(and (<= main_~i~0 10) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {5041#false} is VALID [2022-04-15 05:41:56,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {5041#false} ~i~0 := 0; {5041#false} is VALID [2022-04-15 05:41:56,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-15 05:41:56,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-15 05:41:56,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-15 05:41:56,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 43: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 44: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 45: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 46: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 47: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 48: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 49: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-15 05:41:56,619 INFO L290 TraceCheckUtils]: 50: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-15 05:41:56,620 INFO L290 TraceCheckUtils]: 51: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-15 05:41:56,620 INFO L290 TraceCheckUtils]: 52: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-15 05:41:56,620 INFO L290 TraceCheckUtils]: 53: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-15 05:41:56,620 INFO L290 TraceCheckUtils]: 54: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-15 05:41:56,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {5041#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5041#false} is VALID [2022-04-15 05:41:56,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {5041#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5041#false} is VALID [2022-04-15 05:41:56,620 INFO L290 TraceCheckUtils]: 57: Hoare triple {5041#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5041#false} is VALID [2022-04-15 05:41:56,620 INFO L290 TraceCheckUtils]: 58: Hoare triple {5041#false} assume !(~i~0 % 4294967296 < 102400); {5041#false} is VALID [2022-04-15 05:41:56,620 INFO L290 TraceCheckUtils]: 59: Hoare triple {5041#false} assume !false; {5041#false} is VALID [2022-04-15 05:41:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-15 05:41:56,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:56,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515962557] [2022-04-15 05:41:56,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515962557] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:56,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298480091] [2022-04-15 05:41:56,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:56,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:56,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:56,621 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-15 05:41:56,635 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-15 05:41:56,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:41:56,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:56,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 05:41:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:57,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {5040#true} call ULTIMATE.init(); {5040#true} is VALID [2022-04-15 05:41:57,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {5040#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5040#true} is VALID [2022-04-15 05:41:57,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {5040#true} assume true; {5040#true} is VALID [2022-04-15 05:41:57,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5040#true} {5040#true} #43#return; {5040#true} is VALID [2022-04-15 05:41:57,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {5040#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5040#true} is VALID [2022-04-15 05:41:57,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {5040#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {5040#true} is VALID [2022-04-15 05:41:57,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {5040#true} assume !(~i~0 % 4294967296 < 102400); {5040#true} is VALID [2022-04-15 05:41:57,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {5040#true} ~i~0 := 0; {5045#(= main_~i~0 0)} is VALID [2022-04-15 05:41:57,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {5045#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5045#(= main_~i~0 0)} is VALID [2022-04-15 05:41:57,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {5045#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5045#(= main_~i~0 0)} is VALID [2022-04-15 05:41:57,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {5045#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:57,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:57,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:57,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {5046#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:57,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:57,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:57,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {5047#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:57,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:57,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:57,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {5048#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:57,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:57,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:57,106 INFO L290 TraceCheckUtils]: 42: Hoare triple {5049#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:57,107 INFO L290 TraceCheckUtils]: 43: Hoare triple {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:57,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:57,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {5050#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:57,108 INFO L290 TraceCheckUtils]: 46: Hoare triple {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:57,108 INFO L290 TraceCheckUtils]: 47: Hoare triple {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:57,109 INFO L290 TraceCheckUtils]: 48: Hoare triple {5051#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:57,109 INFO L290 TraceCheckUtils]: 49: Hoare triple {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:57,109 INFO L290 TraceCheckUtils]: 50: Hoare triple {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:57,110 INFO L290 TraceCheckUtils]: 51: Hoare triple {5052#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:41:57,110 INFO L290 TraceCheckUtils]: 52: Hoare triple {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:41:57,110 INFO L290 TraceCheckUtils]: 53: Hoare triple {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:41:57,111 INFO L290 TraceCheckUtils]: 54: Hoare triple {5053#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:41:57,111 INFO L290 TraceCheckUtils]: 55: Hoare triple {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:41:57,112 INFO L290 TraceCheckUtils]: 56: Hoare triple {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:41:57,112 INFO L290 TraceCheckUtils]: 57: Hoare triple {5054#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5231#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:41:57,113 INFO L290 TraceCheckUtils]: 58: Hoare triple {5231#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {5041#false} is VALID [2022-04-15 05:41:57,113 INFO L290 TraceCheckUtils]: 59: Hoare triple {5041#false} assume !false; {5041#false} is VALID [2022-04-15 05:41:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-15 05:41:57,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:57,474 INFO L290 TraceCheckUtils]: 59: Hoare triple {5041#false} assume !false; {5041#false} is VALID [2022-04-15 05:41:57,475 INFO L290 TraceCheckUtils]: 58: Hoare triple {5241#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {5041#false} is VALID [2022-04-15 05:41:57,475 INFO L290 TraceCheckUtils]: 57: Hoare triple {5245#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5241#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:41:57,476 INFO L290 TraceCheckUtils]: 56: Hoare triple {5245#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5245#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,476 INFO L290 TraceCheckUtils]: 55: Hoare triple {5245#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5245#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,477 INFO L290 TraceCheckUtils]: 54: Hoare triple {5255#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5245#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,477 INFO L290 TraceCheckUtils]: 53: Hoare triple {5255#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5255#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,477 INFO L290 TraceCheckUtils]: 52: Hoare triple {5255#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5255#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,478 INFO L290 TraceCheckUtils]: 51: Hoare triple {5265#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5255#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,478 INFO L290 TraceCheckUtils]: 50: Hoare triple {5265#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5265#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,478 INFO L290 TraceCheckUtils]: 49: Hoare triple {5265#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5265#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,479 INFO L290 TraceCheckUtils]: 48: Hoare triple {5275#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5265#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,479 INFO L290 TraceCheckUtils]: 47: Hoare triple {5275#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5275#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,480 INFO L290 TraceCheckUtils]: 46: Hoare triple {5275#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5275#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {5285#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5275#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {5285#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5285#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {5285#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5285#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {5295#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5285#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {5295#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5295#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {5295#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5295#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,483 INFO L290 TraceCheckUtils]: 39: Hoare triple {5305#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5295#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {5305#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5305#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {5305#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5305#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {5315#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5305#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {5315#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5315#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,485 INFO L290 TraceCheckUtils]: 34: Hoare triple {5315#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5315#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,485 INFO L290 TraceCheckUtils]: 33: Hoare triple {5325#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5315#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {5325#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5325#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {5325#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5325#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {5335#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5325#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {5335#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5335#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {5335#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5335#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {5040#true} ~i~0 := 0; {5335#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:41:57,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {5040#true} assume !(~i~0 % 4294967296 < 102400); {5040#true} is VALID [2022-04-15 05:41:57,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {5040#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {5040#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5040#true} is VALID [2022-04-15 05:41:57,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {5040#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {5040#true} is VALID [2022-04-15 05:41:57,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {5040#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5040#true} is VALID [2022-04-15 05:41:57,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5040#true} {5040#true} #43#return; {5040#true} is VALID [2022-04-15 05:41:57,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {5040#true} assume true; {5040#true} is VALID [2022-04-15 05:41:57,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {5040#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5040#true} is VALID [2022-04-15 05:41:57,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {5040#true} call ULTIMATE.init(); {5040#true} is VALID [2022-04-15 05:41:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-15 05:41:57,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298480091] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:57,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:57,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-15 05:41:57,489 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:57,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1446848125] [2022-04-15 05:41:57,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1446848125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:57,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:57,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 05:41:57,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500749748] [2022-04-15 05:41:57,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:57,490 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 05:41:57,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:57,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:57,512 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-15 05:41:57,512 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 05:41:57,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:57,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 05:41:57,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-15 05:41:57,513 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:58,246 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2022-04-15 05:41:58,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 05:41:58,246 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 05:41:58,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:58,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 78 transitions. [2022-04-15 05:41:58,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 78 transitions. [2022-04-15 05:41:58,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 78 transitions. [2022-04-15 05:41:58,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:58,302 INFO L225 Difference]: With dead ends: 103 [2022-04-15 05:41:58,302 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 05:41:58,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2022-04-15 05:41:58,302 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 43 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:58,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 142 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:41:58,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 05:41:58,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2022-04-15 05:41:58,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:58,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:58,363 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:58,363 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:58,364 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-15 05:41:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-15 05:41:58,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:58,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:58,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 05:41:58,364 INFO L87 Difference]: Start difference. First operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 05:41:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:58,365 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-15 05:41:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-15 05:41:58,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:58,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:58,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:58,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2022-04-15 05:41:58,366 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 60 [2022-04-15 05:41:58,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:58,367 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2022-04-15 05:41:58,367 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:58,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 67 transitions. [2022-04-15 05:41:58,411 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-15 05:41:58,411 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2022-04-15 05:41:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 05:41:58,411 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:58,411 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:58,433 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-15 05:41:58,612 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,SelfDestructingSolverStorable11 [2022-04-15 05:41:58,612 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:58,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1686779215, now seen corresponding path program 21 times [2022-04-15 05:41:58,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:58,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [442971233] [2022-04-15 05:41:58,620 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:58,620 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:58,620 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:58,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1686779215, now seen corresponding path program 22 times [2022-04-15 05:41:58,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:58,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978879811] [2022-04-15 05:41:58,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:58,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:58,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:58,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {5923#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5906#true} is VALID [2022-04-15 05:41:58,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {5906#true} assume true; {5906#true} is VALID [2022-04-15 05:41:58,839 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5906#true} {5906#true} #43#return; {5906#true} is VALID [2022-04-15 05:41:58,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {5906#true} call ULTIMATE.init(); {5923#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:58,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {5923#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5906#true} is VALID [2022-04-15 05:41:58,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {5906#true} assume true; {5906#true} is VALID [2022-04-15 05:41:58,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5906#true} {5906#true} #43#return; {5906#true} is VALID [2022-04-15 05:41:58,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {5906#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5906#true} is VALID [2022-04-15 05:41:58,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {5906#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {5911#(= main_~i~0 0)} is VALID [2022-04-15 05:41:58,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {5911#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5911#(= main_~i~0 0)} is VALID [2022-04-15 05:41:58,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {5911#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:58,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:58,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:58,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:58,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:58,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:58,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:58,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:58,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:58,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:58,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:58,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:58,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:58,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:58,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:41:58,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:41:58,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:41:58,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:41:58,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:41:58,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:41:58,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5922#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 11))} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {5922#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 11))} assume !(~i~0 % 4294967296 < 102400); {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {5907#false} ~i~0 := 0; {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 38: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 39: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 40: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 41: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 42: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 43: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-15 05:41:58,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 47: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 48: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 49: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 50: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 51: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 55: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 56: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 57: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 58: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 59: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 60: Hoare triple {5907#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 61: Hoare triple {5907#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 62: Hoare triple {5907#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 63: Hoare triple {5907#false} assume !(~i~0 % 4294967296 < 102400); {5907#false} is VALID [2022-04-15 05:41:58,851 INFO L290 TraceCheckUtils]: 64: Hoare triple {5907#false} assume !false; {5907#false} is VALID [2022-04-15 05:41:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-04-15 05:41:58,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:58,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978879811] [2022-04-15 05:41:58,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978879811] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:58,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900027517] [2022-04-15 05:41:58,852 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:41:58,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:58,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:58,853 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-15 05:41:58,853 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-15 05:41:59,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:41:59,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:59,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 05:41:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:59,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:59,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {5906#true} call ULTIMATE.init(); {5906#true} is VALID [2022-04-15 05:41:59,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {5906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5906#true} is VALID [2022-04-15 05:41:59,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {5906#true} assume true; {5906#true} is VALID [2022-04-15 05:41:59,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5906#true} {5906#true} #43#return; {5906#true} is VALID [2022-04-15 05:41:59,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {5906#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5906#true} is VALID [2022-04-15 05:41:59,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {5906#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {5906#true} is VALID [2022-04-15 05:41:59,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {5906#true} assume !(~i~0 % 4294967296 < 102400); {5906#true} is VALID [2022-04-15 05:41:59,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {5906#true} ~i~0 := 0; {5911#(= main_~i~0 0)} is VALID [2022-04-15 05:41:59,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {5911#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5911#(= main_~i~0 0)} is VALID [2022-04-15 05:41:59,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {5911#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5911#(= main_~i~0 0)} is VALID [2022-04-15 05:41:59,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {5911#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:59,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:59,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:41:59,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {5912#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:59,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:59,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:41:59,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {5913#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:59,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:59,429 INFO L290 TraceCheckUtils]: 40: Hoare triple {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:41:59,430 INFO L290 TraceCheckUtils]: 41: Hoare triple {5914#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:59,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:59,430 INFO L290 TraceCheckUtils]: 43: Hoare triple {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:41:59,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {5915#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:59,431 INFO L290 TraceCheckUtils]: 45: Hoare triple {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:59,431 INFO L290 TraceCheckUtils]: 46: Hoare triple {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:41:59,432 INFO L290 TraceCheckUtils]: 47: Hoare triple {5916#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:59,432 INFO L290 TraceCheckUtils]: 48: Hoare triple {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:59,432 INFO L290 TraceCheckUtils]: 49: Hoare triple {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:41:59,433 INFO L290 TraceCheckUtils]: 50: Hoare triple {5917#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:59,433 INFO L290 TraceCheckUtils]: 51: Hoare triple {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:59,433 INFO L290 TraceCheckUtils]: 52: Hoare triple {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:41:59,434 INFO L290 TraceCheckUtils]: 53: Hoare triple {5918#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:41:59,434 INFO L290 TraceCheckUtils]: 54: Hoare triple {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:41:59,434 INFO L290 TraceCheckUtils]: 55: Hoare triple {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:41:59,435 INFO L290 TraceCheckUtils]: 56: Hoare triple {5919#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:41:59,437 INFO L290 TraceCheckUtils]: 57: Hoare triple {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:41:59,438 INFO L290 TraceCheckUtils]: 58: Hoare triple {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:41:59,438 INFO L290 TraceCheckUtils]: 59: Hoare triple {5920#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:41:59,438 INFO L290 TraceCheckUtils]: 60: Hoare triple {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:41:59,439 INFO L290 TraceCheckUtils]: 61: Hoare triple {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:41:59,439 INFO L290 TraceCheckUtils]: 62: Hoare triple {5921#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6113#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:41:59,439 INFO L290 TraceCheckUtils]: 63: Hoare triple {6113#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !(~i~0 % 4294967296 < 102400); {5907#false} is VALID [2022-04-15 05:41:59,440 INFO L290 TraceCheckUtils]: 64: Hoare triple {5907#false} assume !false; {5907#false} is VALID [2022-04-15 05:41:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-15 05:41:59,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:59,812 INFO L290 TraceCheckUtils]: 64: Hoare triple {5907#false} assume !false; {5907#false} is VALID [2022-04-15 05:41:59,813 INFO L290 TraceCheckUtils]: 63: Hoare triple {6123#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {5907#false} is VALID [2022-04-15 05:41:59,813 INFO L290 TraceCheckUtils]: 62: Hoare triple {6127#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6123#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:41:59,813 INFO L290 TraceCheckUtils]: 61: Hoare triple {6127#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6127#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,814 INFO L290 TraceCheckUtils]: 60: Hoare triple {6127#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6127#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,814 INFO L290 TraceCheckUtils]: 59: Hoare triple {6137#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6127#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,814 INFO L290 TraceCheckUtils]: 58: Hoare triple {6137#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6137#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,815 INFO L290 TraceCheckUtils]: 57: Hoare triple {6137#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6137#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,815 INFO L290 TraceCheckUtils]: 56: Hoare triple {6147#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6137#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,815 INFO L290 TraceCheckUtils]: 55: Hoare triple {6147#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6147#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,816 INFO L290 TraceCheckUtils]: 54: Hoare triple {6147#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6147#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,816 INFO L290 TraceCheckUtils]: 53: Hoare triple {6157#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6147#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,816 INFO L290 TraceCheckUtils]: 52: Hoare triple {6157#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6157#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,817 INFO L290 TraceCheckUtils]: 51: Hoare triple {6157#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6157#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,817 INFO L290 TraceCheckUtils]: 50: Hoare triple {6167#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6157#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {6167#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6167#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {6167#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6167#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,818 INFO L290 TraceCheckUtils]: 47: Hoare triple {6177#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6167#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,818 INFO L290 TraceCheckUtils]: 46: Hoare triple {6177#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6177#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {6177#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6177#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {6187#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6177#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,820 INFO L290 TraceCheckUtils]: 43: Hoare triple {6187#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6187#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {6187#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6187#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,820 INFO L290 TraceCheckUtils]: 41: Hoare triple {6197#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6187#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,821 INFO L290 TraceCheckUtils]: 40: Hoare triple {6197#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6197#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {6197#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6197#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {6207#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6197#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,830 INFO L290 TraceCheckUtils]: 37: Hoare triple {6207#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6207#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {6207#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6207#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {6217#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6207#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,831 INFO L290 TraceCheckUtils]: 34: Hoare triple {6217#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6217#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {6217#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6217#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {6227#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6217#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {6227#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6227#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {6227#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6227#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {5906#true} ~i~0 := 0; {6227#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 05:41:59,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {5906#true} assume !(~i~0 % 4294967296 < 102400); {5906#true} is VALID [2022-04-15 05:41:59,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {5906#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5906#true} is VALID [2022-04-15 05:41:59,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {5906#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {5906#true} is VALID [2022-04-15 05:41:59,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {5906#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {5906#true} is VALID [2022-04-15 05:41:59,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {5906#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5906#true} is VALID [2022-04-15 05:41:59,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5906#true} {5906#true} #43#return; {5906#true} is VALID [2022-04-15 05:41:59,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {5906#true} assume true; {5906#true} is VALID [2022-04-15 05:41:59,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {5906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5906#true} is VALID [2022-04-15 05:41:59,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {5906#true} call ULTIMATE.init(); {5906#true} is VALID [2022-04-15 05:41:59,835 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-15 05:41:59,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900027517] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:59,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:59,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-15 05:41:59,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:59,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [442971233] [2022-04-15 05:41:59,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [442971233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:59,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:59,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 05:41:59,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729535358] [2022-04-15 05:41:59,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:59,836 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 05:41:59,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:59,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:59,859 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-15 05:41:59,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 05:41:59,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:59,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 05:41:59,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2022-04-15 05:41:59,860 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:00,795 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2022-04-15 05:42:00,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 05:42:00,795 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 05:42:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 83 transitions. [2022-04-15 05:42:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 83 transitions. [2022-04-15 05:42:00,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 83 transitions. [2022-04-15 05:42:00,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:00,849 INFO L225 Difference]: With dead ends: 111 [2022-04-15 05:42:00,849 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 05:42:00,850 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2022-04-15 05:42:00,850 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:00,850 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 193 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 05:42:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 05:42:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2022-04-15 05:42:00,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:00,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,903 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,903 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:00,904 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-04-15 05:42:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-04-15 05:42:00,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:00,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:00,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-15 05:42:00,904 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-15 05:42:00,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:00,905 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-04-15 05:42:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-04-15 05:42:00,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:00,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:00,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:00,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2022-04-15 05:42:00,906 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 65 [2022-04-15 05:42:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:00,906 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2022-04-15 05:42:00,907 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 72 transitions. [2022-04-15 05:42:00,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-04-15 05:42:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 05:42:00,989 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:00,989 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:01,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-15 05:42:01,191 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,SelfDestructingSolverStorable12 [2022-04-15 05:42:01,191 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:01,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:01,192 INFO L85 PathProgramCache]: Analyzing trace with hash -595686744, now seen corresponding path program 23 times [2022-04-15 05:42:01,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:01,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1561079602] [2022-04-15 05:42:01,200 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:01,200 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:01,200 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:01,200 INFO L85 PathProgramCache]: Analyzing trace with hash -595686744, now seen corresponding path program 24 times [2022-04-15 05:42:01,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:01,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87593412] [2022-04-15 05:42:01,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:01,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:01,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:01,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {6858#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {6840#true} is VALID [2022-04-15 05:42:01,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {6840#true} assume true; {6840#true} is VALID [2022-04-15 05:42:01,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6840#true} {6840#true} #43#return; {6840#true} is VALID [2022-04-15 05:42:01,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {6840#true} call ULTIMATE.init(); {6858#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:01,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {6858#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {6840#true} is VALID [2022-04-15 05:42:01,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {6840#true} assume true; {6840#true} is VALID [2022-04-15 05:42:01,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6840#true} {6840#true} #43#return; {6840#true} is VALID [2022-04-15 05:42:01,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {6840#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {6840#true} is VALID [2022-04-15 05:42:01,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {6840#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {6845#(= main_~i~0 0)} is VALID [2022-04-15 05:42:01,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {6845#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6845#(= main_~i~0 0)} is VALID [2022-04-15 05:42:01,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {6845#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:01,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:01,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:01,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:01,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:01,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:01,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:01,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:01,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:01,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:01,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:01,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:01,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:01,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:01,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:01,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:01,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:01,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:01,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:01,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:01,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:01,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:01,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6857#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:01,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {6857#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 12))} assume !(~i~0 % 4294967296 < 102400); {6841#false} is VALID [2022-04-15 05:42:01,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {6841#false} ~i~0 := 0; {6841#false} is VALID [2022-04-15 05:42:01,449 INFO L290 TraceCheckUtils]: 32: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 36: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 37: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 38: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 39: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 42: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 43: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 46: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 50: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 51: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-15 05:42:01,450 INFO L290 TraceCheckUtils]: 52: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 53: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 54: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 55: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 56: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 57: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 58: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 59: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 60: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 62: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 63: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 64: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 65: Hoare triple {6841#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 66: Hoare triple {6841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 67: Hoare triple {6841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 68: Hoare triple {6841#false} assume !(~i~0 % 4294967296 < 102400); {6841#false} is VALID [2022-04-15 05:42:01,451 INFO L290 TraceCheckUtils]: 69: Hoare triple {6841#false} assume !false; {6841#false} is VALID [2022-04-15 05:42:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-15 05:42:01,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:01,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87593412] [2022-04-15 05:42:01,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87593412] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:01,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898562622] [2022-04-15 05:42:01,452 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:42:01,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:01,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:01,453 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-15 05:42:01,454 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-15 05:42:09,165 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-15 05:42:09,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:09,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 05:42:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:09,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:09,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {6840#true} call ULTIMATE.init(); {6840#true} is VALID [2022-04-15 05:42:09,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {6840#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {6840#true} is VALID [2022-04-15 05:42:09,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {6840#true} assume true; {6840#true} is VALID [2022-04-15 05:42:09,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6840#true} {6840#true} #43#return; {6840#true} is VALID [2022-04-15 05:42:09,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {6840#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {6840#true} is VALID [2022-04-15 05:42:09,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {6840#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {6840#true} is VALID [2022-04-15 05:42:09,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:09,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:09,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:09,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:09,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:09,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:09,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:09,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:09,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {6840#true} assume !(~i~0 % 4294967296 < 102400); {6840#true} is VALID [2022-04-15 05:42:09,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {6840#true} ~i~0 := 0; {6845#(= main_~i~0 0)} is VALID [2022-04-15 05:42:09,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {6845#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6845#(= main_~i~0 0)} is VALID [2022-04-15 05:42:09,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {6845#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6845#(= main_~i~0 0)} is VALID [2022-04-15 05:42:09,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {6845#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:09,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:09,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:09,587 INFO L290 TraceCheckUtils]: 37: Hoare triple {6846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:09,587 INFO L290 TraceCheckUtils]: 38: Hoare triple {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:09,587 INFO L290 TraceCheckUtils]: 39: Hoare triple {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:09,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {6847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:09,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:09,588 INFO L290 TraceCheckUtils]: 42: Hoare triple {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:09,589 INFO L290 TraceCheckUtils]: 43: Hoare triple {6848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:09,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:09,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:09,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {6849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:09,590 INFO L290 TraceCheckUtils]: 47: Hoare triple {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:09,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:09,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {6850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:09,623 INFO L290 TraceCheckUtils]: 50: Hoare triple {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:09,631 INFO L290 TraceCheckUtils]: 51: Hoare triple {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:09,632 INFO L290 TraceCheckUtils]: 52: Hoare triple {6851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:09,632 INFO L290 TraceCheckUtils]: 53: Hoare triple {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:09,632 INFO L290 TraceCheckUtils]: 54: Hoare triple {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:09,633 INFO L290 TraceCheckUtils]: 55: Hoare triple {6852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:09,633 INFO L290 TraceCheckUtils]: 56: Hoare triple {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:09,634 INFO L290 TraceCheckUtils]: 57: Hoare triple {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:09,634 INFO L290 TraceCheckUtils]: 58: Hoare triple {6853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:09,634 INFO L290 TraceCheckUtils]: 59: Hoare triple {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:09,635 INFO L290 TraceCheckUtils]: 60: Hoare triple {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:09,635 INFO L290 TraceCheckUtils]: 61: Hoare triple {6854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:09,635 INFO L290 TraceCheckUtils]: 62: Hoare triple {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:09,636 INFO L290 TraceCheckUtils]: 63: Hoare triple {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:09,636 INFO L290 TraceCheckUtils]: 64: Hoare triple {6855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:09,637 INFO L290 TraceCheckUtils]: 65: Hoare triple {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:09,637 INFO L290 TraceCheckUtils]: 66: Hoare triple {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:09,637 INFO L290 TraceCheckUtils]: 67: Hoare triple {6856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7063#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:09,638 INFO L290 TraceCheckUtils]: 68: Hoare triple {7063#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !(~i~0 % 4294967296 < 102400); {6841#false} is VALID [2022-04-15 05:42:09,638 INFO L290 TraceCheckUtils]: 69: Hoare triple {6841#false} assume !false; {6841#false} is VALID [2022-04-15 05:42:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 05:42:09,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:10,606 INFO L290 TraceCheckUtils]: 69: Hoare triple {6841#false} assume !false; {6841#false} is VALID [2022-04-15 05:42:10,606 INFO L290 TraceCheckUtils]: 68: Hoare triple {7073#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {6841#false} is VALID [2022-04-15 05:42:10,607 INFO L290 TraceCheckUtils]: 67: Hoare triple {7077#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7073#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:42:10,607 INFO L290 TraceCheckUtils]: 66: Hoare triple {7077#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7077#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:42:10,608 INFO L290 TraceCheckUtils]: 65: Hoare triple {7084#(or (not (< (mod main_~i~0 4294967296) 102400)) (< (mod (+ main_~i~0 1) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7077#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:42:10,608 INFO L290 TraceCheckUtils]: 64: Hoare triple {7088#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7084#(or (not (< (mod main_~i~0 4294967296) 102400)) (< (mod (+ main_~i~0 1) 4294967296) 102400))} is VALID [2022-04-15 05:42:10,609 INFO L290 TraceCheckUtils]: 63: Hoare triple {7088#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7088#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} is VALID [2022-04-15 05:42:10,609 INFO L290 TraceCheckUtils]: 62: Hoare triple {7088#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7088#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} is VALID [2022-04-15 05:42:10,610 INFO L290 TraceCheckUtils]: 61: Hoare triple {7098#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7088#(or (not (< (mod (+ main_~i~0 1) 4294967296) 102400)) (< (mod (+ main_~i~0 2) 4294967296) 102400))} is VALID [2022-04-15 05:42:10,610 INFO L290 TraceCheckUtils]: 60: Hoare triple {7098#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7098#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} is VALID [2022-04-15 05:42:10,610 INFO L290 TraceCheckUtils]: 59: Hoare triple {7098#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7098#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} is VALID [2022-04-15 05:42:10,611 INFO L290 TraceCheckUtils]: 58: Hoare triple {7108#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7098#(or (not (< (mod (+ main_~i~0 2) 4294967296) 102400)) (< (mod (+ main_~i~0 3) 4294967296) 102400))} is VALID [2022-04-15 05:42:10,611 INFO L290 TraceCheckUtils]: 57: Hoare triple {7108#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7108#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,611 INFO L290 TraceCheckUtils]: 56: Hoare triple {7108#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7108#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,612 INFO L290 TraceCheckUtils]: 55: Hoare triple {7118#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7108#(or (< (mod (+ main_~i~0 4) 4294967296) 102400) (not (< (mod (+ main_~i~0 3) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,613 INFO L290 TraceCheckUtils]: 54: Hoare triple {7118#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7118#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} is VALID [2022-04-15 05:42:10,613 INFO L290 TraceCheckUtils]: 53: Hoare triple {7118#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7118#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} is VALID [2022-04-15 05:42:10,614 INFO L290 TraceCheckUtils]: 52: Hoare triple {7128#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7118#(or (not (< (mod (+ main_~i~0 4) 4294967296) 102400)) (< (mod (+ 5 main_~i~0) 4294967296) 102400))} is VALID [2022-04-15 05:42:10,614 INFO L290 TraceCheckUtils]: 51: Hoare triple {7128#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7128#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} is VALID [2022-04-15 05:42:10,614 INFO L290 TraceCheckUtils]: 50: Hoare triple {7128#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7128#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} is VALID [2022-04-15 05:42:10,615 INFO L290 TraceCheckUtils]: 49: Hoare triple {7138#(or (< (mod (+ 7 main_~i~0) 4294967296) 102400) (not (< (mod (+ main_~i~0 6) 4294967296) 102400)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7128#(or (not (< (mod (+ 5 main_~i~0) 4294967296) 102400)) (< (mod (+ main_~i~0 6) 4294967296) 102400))} is VALID [2022-04-15 05:42:10,615 INFO L290 TraceCheckUtils]: 48: Hoare triple {7138#(or (< (mod (+ 7 main_~i~0) 4294967296) 102400) (not (< (mod (+ main_~i~0 6) 4294967296) 102400)))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7138#(or (< (mod (+ 7 main_~i~0) 4294967296) 102400) (not (< (mod (+ main_~i~0 6) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,616 INFO L290 TraceCheckUtils]: 47: Hoare triple {7138#(or (< (mod (+ 7 main_~i~0) 4294967296) 102400) (not (< (mod (+ main_~i~0 6) 4294967296) 102400)))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7138#(or (< (mod (+ 7 main_~i~0) 4294967296) 102400) (not (< (mod (+ main_~i~0 6) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {7148#(or (< (mod (+ main_~i~0 8) 4294967296) 102400) (not (< (mod (+ 7 main_~i~0) 4294967296) 102400)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7138#(or (< (mod (+ 7 main_~i~0) 4294967296) 102400) (not (< (mod (+ main_~i~0 6) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,617 INFO L290 TraceCheckUtils]: 45: Hoare triple {7148#(or (< (mod (+ main_~i~0 8) 4294967296) 102400) (not (< (mod (+ 7 main_~i~0) 4294967296) 102400)))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7148#(or (< (mod (+ main_~i~0 8) 4294967296) 102400) (not (< (mod (+ 7 main_~i~0) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {7148#(or (< (mod (+ main_~i~0 8) 4294967296) 102400) (not (< (mod (+ 7 main_~i~0) 4294967296) 102400)))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7148#(or (< (mod (+ main_~i~0 8) 4294967296) 102400) (not (< (mod (+ 7 main_~i~0) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,618 INFO L290 TraceCheckUtils]: 43: Hoare triple {7158#(or (< (mod (+ main_~i~0 9) 4294967296) 102400) (not (< (mod (+ main_~i~0 8) 4294967296) 102400)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7148#(or (< (mod (+ main_~i~0 8) 4294967296) 102400) (not (< (mod (+ 7 main_~i~0) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {7158#(or (< (mod (+ main_~i~0 9) 4294967296) 102400) (not (< (mod (+ main_~i~0 8) 4294967296) 102400)))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7158#(or (< (mod (+ main_~i~0 9) 4294967296) 102400) (not (< (mod (+ main_~i~0 8) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,621 INFO L290 TraceCheckUtils]: 41: Hoare triple {7158#(or (< (mod (+ main_~i~0 9) 4294967296) 102400) (not (< (mod (+ main_~i~0 8) 4294967296) 102400)))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7158#(or (< (mod (+ main_~i~0 9) 4294967296) 102400) (not (< (mod (+ main_~i~0 8) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {7168#(or (< (mod (+ main_~i~0 10) 4294967296) 102400) (not (< (mod (+ main_~i~0 9) 4294967296) 102400)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7158#(or (< (mod (+ main_~i~0 9) 4294967296) 102400) (not (< (mod (+ main_~i~0 8) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {7168#(or (< (mod (+ main_~i~0 10) 4294967296) 102400) (not (< (mod (+ main_~i~0 9) 4294967296) 102400)))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7168#(or (< (mod (+ main_~i~0 10) 4294967296) 102400) (not (< (mod (+ main_~i~0 9) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,623 INFO L290 TraceCheckUtils]: 38: Hoare triple {7168#(or (< (mod (+ main_~i~0 10) 4294967296) 102400) (not (< (mod (+ main_~i~0 9) 4294967296) 102400)))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7168#(or (< (mod (+ main_~i~0 10) 4294967296) 102400) (not (< (mod (+ main_~i~0 9) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {7178#(or (< (mod (+ main_~i~0 11) 4294967296) 102400) (not (< (mod (+ main_~i~0 10) 4294967296) 102400)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7168#(or (< (mod (+ main_~i~0 10) 4294967296) 102400) (not (< (mod (+ main_~i~0 9) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,624 INFO L290 TraceCheckUtils]: 36: Hoare triple {7178#(or (< (mod (+ main_~i~0 11) 4294967296) 102400) (not (< (mod (+ main_~i~0 10) 4294967296) 102400)))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7178#(or (< (mod (+ main_~i~0 11) 4294967296) 102400) (not (< (mod (+ main_~i~0 10) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {7178#(or (< (mod (+ main_~i~0 11) 4294967296) 102400) (not (< (mod (+ main_~i~0 10) 4294967296) 102400)))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7178#(or (< (mod (+ main_~i~0 11) 4294967296) 102400) (not (< (mod (+ main_~i~0 10) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {7188#(or (not (< (mod (+ main_~i~0 11) 4294967296) 102400)) (< (mod (+ main_~i~0 12) 4294967296) 102400))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7178#(or (< (mod (+ main_~i~0 11) 4294967296) 102400) (not (< (mod (+ main_~i~0 10) 4294967296) 102400)))} is VALID [2022-04-15 05:42:10,625 INFO L290 TraceCheckUtils]: 33: Hoare triple {7188#(or (not (< (mod (+ main_~i~0 11) 4294967296) 102400)) (< (mod (+ main_~i~0 12) 4294967296) 102400))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7188#(or (not (< (mod (+ main_~i~0 11) 4294967296) 102400)) (< (mod (+ main_~i~0 12) 4294967296) 102400))} is VALID [2022-04-15 05:42:10,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {7188#(or (not (< (mod (+ main_~i~0 11) 4294967296) 102400)) (< (mod (+ main_~i~0 12) 4294967296) 102400))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7188#(or (not (< (mod (+ main_~i~0 11) 4294967296) 102400)) (< (mod (+ main_~i~0 12) 4294967296) 102400))} is VALID [2022-04-15 05:42:10,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {6840#true} ~i~0 := 0; {7188#(or (not (< (mod (+ main_~i~0 11) 4294967296) 102400)) (< (mod (+ main_~i~0 12) 4294967296) 102400))} is VALID [2022-04-15 05:42:10,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {6840#true} assume !(~i~0 % 4294967296 < 102400); {6840#true} is VALID [2022-04-15 05:42:10,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:10,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:10,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:10,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:10,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:10,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:10,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:10,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:10,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {6840#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {6840#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {6840#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {6840#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {6840#true} is VALID [2022-04-15 05:42:10,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6840#true} {6840#true} #43#return; {6840#true} is VALID [2022-04-15 05:42:10,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {6840#true} assume true; {6840#true} is VALID [2022-04-15 05:42:10,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {6840#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {6840#true} is VALID [2022-04-15 05:42:10,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {6840#true} call ULTIMATE.init(); {6840#true} is VALID [2022-04-15 05:42:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 05:42:10,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898562622] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:10,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:10,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 31 [2022-04-15 05:42:10,628 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:10,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1561079602] [2022-04-15 05:42:10,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1561079602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:10,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:10,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 05:42:10,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820630464] [2022-04-15 05:42:10,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:10,629 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 05:42:10,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:10,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:10,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:10,655 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 05:42:10,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:10,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 05:42:10,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2022-04-15 05:42:10,656 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:11,706 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2022-04-15 05:42:11,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 05:42:11,706 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 05:42:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:11,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 88 transitions. [2022-04-15 05:42:11,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 88 transitions. [2022-04-15 05:42:11,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 88 transitions. [2022-04-15 05:42:11,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:11,776 INFO L225 Difference]: With dead ends: 119 [2022-04-15 05:42:11,776 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 05:42:11,776 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=288, Invalid=704, Unknown=0, NotChecked=0, Total=992 [2022-04-15 05:42:11,777 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 51 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:11,777 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 191 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 05:42:11,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 05:42:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-04-15 05:42:11,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:11,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:11,833 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:11,833 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:11,834 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2022-04-15 05:42:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-15 05:42:11,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:11,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:11,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 05:42:11,835 INFO L87 Difference]: Start difference. First operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 05:42:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:11,835 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2022-04-15 05:42:11,835 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-15 05:42:11,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:11,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:11,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:11,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2022-04-15 05:42:11,837 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 70 [2022-04-15 05:42:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:11,837 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2022-04-15 05:42:11,837 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:11,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 77 transitions. [2022-04-15 05:42:11,891 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-15 05:42:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2022-04-15 05:42:11,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 05:42:11,892 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:11,892 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:11,900 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-15 05:42:12,098 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,SelfDestructingSolverStorable13 [2022-04-15 05:42:12,098 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:12,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:12,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1264174643, now seen corresponding path program 25 times [2022-04-15 05:42:12,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:12,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1677237760] [2022-04-15 05:42:12,107 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:12,107 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:12,107 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1264174643, now seen corresponding path program 26 times [2022-04-15 05:42:12,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:12,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613253211] [2022-04-15 05:42:12,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:12,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:12,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:12,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {7862#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {7843#true} is VALID [2022-04-15 05:42:12,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {7843#true} assume true; {7843#true} is VALID [2022-04-15 05:42:12,352 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7843#true} {7843#true} #43#return; {7843#true} is VALID [2022-04-15 05:42:12,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {7843#true} call ULTIMATE.init(); {7862#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:12,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {7862#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {7843#true} is VALID [2022-04-15 05:42:12,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {7843#true} assume true; {7843#true} is VALID [2022-04-15 05:42:12,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7843#true} {7843#true} #43#return; {7843#true} is VALID [2022-04-15 05:42:12,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {7843#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {7843#true} is VALID [2022-04-15 05:42:12,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {7843#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {7848#(= main_~i~0 0)} is VALID [2022-04-15 05:42:12,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {7848#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7848#(= main_~i~0 0)} is VALID [2022-04-15 05:42:12,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {7848#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:12,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:12,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:12,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:12,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:12,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:12,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:12,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:12,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:12,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:12,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:12,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:12,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:12,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:12,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:12,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:12,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:12,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:12,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:12,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:12,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:12,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:12,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:12,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:12,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7861#(and (<= main_~i~0 13) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:42:12,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {7861#(and (<= main_~i~0 13) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {7844#false} is VALID [2022-04-15 05:42:12,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {7844#false} ~i~0 := 0; {7844#false} is VALID [2022-04-15 05:42:12,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-15 05:42:12,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-15 05:42:12,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 41: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 42: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 43: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 44: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 45: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 46: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 50: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 51: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 52: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 53: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 54: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 55: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-15 05:42:12,366 INFO L290 TraceCheckUtils]: 56: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 57: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 58: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 59: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 60: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 61: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 62: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 63: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 64: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 65: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 66: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 67: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 68: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 69: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 70: Hoare triple {7844#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 71: Hoare triple {7844#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 72: Hoare triple {7844#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 73: Hoare triple {7844#false} assume !(~i~0 % 4294967296 < 102400); {7844#false} is VALID [2022-04-15 05:42:12,367 INFO L290 TraceCheckUtils]: 74: Hoare triple {7844#false} assume !false; {7844#false} is VALID [2022-04-15 05:42:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2022-04-15 05:42:12,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:12,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613253211] [2022-04-15 05:42:12,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613253211] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:12,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655200457] [2022-04-15 05:42:12,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:12,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:12,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:12,369 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-15 05:42:12,370 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-15 05:42:12,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:12,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:12,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 05:42:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:12,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:13,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {7843#true} call ULTIMATE.init(); {7843#true} is VALID [2022-04-15 05:42:13,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {7843#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {7843#true} is VALID [2022-04-15 05:42:13,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {7843#true} assume true; {7843#true} is VALID [2022-04-15 05:42:13,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7843#true} {7843#true} #43#return; {7843#true} is VALID [2022-04-15 05:42:13,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {7843#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {7843#true} is VALID [2022-04-15 05:42:13,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {7843#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {7843#true} is VALID [2022-04-15 05:42:13,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {7843#true} assume !(~i~0 % 4294967296 < 102400); {7843#true} is VALID [2022-04-15 05:42:13,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {7843#true} ~i~0 := 0; {7848#(= main_~i~0 0)} is VALID [2022-04-15 05:42:13,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {7848#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7848#(= main_~i~0 0)} is VALID [2022-04-15 05:42:13,076 INFO L290 TraceCheckUtils]: 35: Hoare triple {7848#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7848#(= main_~i~0 0)} is VALID [2022-04-15 05:42:13,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {7848#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:13,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:13,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:13,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {7849#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:13,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:13,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:13,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {7850#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:13,079 INFO L290 TraceCheckUtils]: 43: Hoare triple {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:13,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:13,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {7851#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:13,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:13,081 INFO L290 TraceCheckUtils]: 47: Hoare triple {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:13,081 INFO L290 TraceCheckUtils]: 48: Hoare triple {7852#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:13,081 INFO L290 TraceCheckUtils]: 49: Hoare triple {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:13,082 INFO L290 TraceCheckUtils]: 50: Hoare triple {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:13,082 INFO L290 TraceCheckUtils]: 51: Hoare triple {7853#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:13,083 INFO L290 TraceCheckUtils]: 52: Hoare triple {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:13,083 INFO L290 TraceCheckUtils]: 53: Hoare triple {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:13,083 INFO L290 TraceCheckUtils]: 54: Hoare triple {7854#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:13,084 INFO L290 TraceCheckUtils]: 55: Hoare triple {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:13,084 INFO L290 TraceCheckUtils]: 56: Hoare triple {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:13,084 INFO L290 TraceCheckUtils]: 57: Hoare triple {7855#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:13,085 INFO L290 TraceCheckUtils]: 58: Hoare triple {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:13,085 INFO L290 TraceCheckUtils]: 59: Hoare triple {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:13,085 INFO L290 TraceCheckUtils]: 60: Hoare triple {7856#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:13,086 INFO L290 TraceCheckUtils]: 61: Hoare triple {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:13,086 INFO L290 TraceCheckUtils]: 62: Hoare triple {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:13,086 INFO L290 TraceCheckUtils]: 63: Hoare triple {7857#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:13,087 INFO L290 TraceCheckUtils]: 64: Hoare triple {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:13,087 INFO L290 TraceCheckUtils]: 65: Hoare triple {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:13,087 INFO L290 TraceCheckUtils]: 66: Hoare triple {7858#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:13,088 INFO L290 TraceCheckUtils]: 67: Hoare triple {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:13,088 INFO L290 TraceCheckUtils]: 68: Hoare triple {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:13,088 INFO L290 TraceCheckUtils]: 69: Hoare triple {7859#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:13,089 INFO L290 TraceCheckUtils]: 70: Hoare triple {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:13,089 INFO L290 TraceCheckUtils]: 71: Hoare triple {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:13,089 INFO L290 TraceCheckUtils]: 72: Hoare triple {7860#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8082#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:13,090 INFO L290 TraceCheckUtils]: 73: Hoare triple {8082#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {7844#false} is VALID [2022-04-15 05:42:13,090 INFO L290 TraceCheckUtils]: 74: Hoare triple {7844#false} assume !false; {7844#false} is VALID [2022-04-15 05:42:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-04-15 05:42:13,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:13,577 INFO L290 TraceCheckUtils]: 74: Hoare triple {7844#false} assume !false; {7844#false} is VALID [2022-04-15 05:42:13,577 INFO L290 TraceCheckUtils]: 73: Hoare triple {8092#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {7844#false} is VALID [2022-04-15 05:42:13,578 INFO L290 TraceCheckUtils]: 72: Hoare triple {8096#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8092#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:42:13,578 INFO L290 TraceCheckUtils]: 71: Hoare triple {8096#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8096#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,579 INFO L290 TraceCheckUtils]: 70: Hoare triple {8096#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8096#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,579 INFO L290 TraceCheckUtils]: 69: Hoare triple {8106#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8096#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,579 INFO L290 TraceCheckUtils]: 68: Hoare triple {8106#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8106#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,579 INFO L290 TraceCheckUtils]: 67: Hoare triple {8106#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8106#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,580 INFO L290 TraceCheckUtils]: 66: Hoare triple {8116#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8106#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,587 INFO L290 TraceCheckUtils]: 65: Hoare triple {8116#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8116#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,587 INFO L290 TraceCheckUtils]: 64: Hoare triple {8116#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8116#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,588 INFO L290 TraceCheckUtils]: 63: Hoare triple {8126#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8116#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,588 INFO L290 TraceCheckUtils]: 62: Hoare triple {8126#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8126#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,588 INFO L290 TraceCheckUtils]: 61: Hoare triple {8126#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8126#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,589 INFO L290 TraceCheckUtils]: 60: Hoare triple {8136#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8126#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,589 INFO L290 TraceCheckUtils]: 59: Hoare triple {8136#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8136#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,589 INFO L290 TraceCheckUtils]: 58: Hoare triple {8136#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8136#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,590 INFO L290 TraceCheckUtils]: 57: Hoare triple {8146#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8136#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,590 INFO L290 TraceCheckUtils]: 56: Hoare triple {8146#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8146#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,590 INFO L290 TraceCheckUtils]: 55: Hoare triple {8146#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8146#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,591 INFO L290 TraceCheckUtils]: 54: Hoare triple {8156#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8146#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,591 INFO L290 TraceCheckUtils]: 53: Hoare triple {8156#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8156#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,591 INFO L290 TraceCheckUtils]: 52: Hoare triple {8156#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8156#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,592 INFO L290 TraceCheckUtils]: 51: Hoare triple {8166#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8156#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,592 INFO L290 TraceCheckUtils]: 50: Hoare triple {8166#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8166#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,592 INFO L290 TraceCheckUtils]: 49: Hoare triple {8166#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8166#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {8176#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8166#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,593 INFO L290 TraceCheckUtils]: 47: Hoare triple {8176#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8176#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {8176#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8176#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {8186#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8176#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {8186#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8186#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {8186#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8186#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,595 INFO L290 TraceCheckUtils]: 42: Hoare triple {8196#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8186#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,595 INFO L290 TraceCheckUtils]: 41: Hoare triple {8196#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8196#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,595 INFO L290 TraceCheckUtils]: 40: Hoare triple {8196#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8196#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,596 INFO L290 TraceCheckUtils]: 39: Hoare triple {8206#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8196#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {8206#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8206#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {8206#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8206#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,597 INFO L290 TraceCheckUtils]: 36: Hoare triple {8216#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8206#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {8216#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8216#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {8216#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8216#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {7843#true} ~i~0 := 0; {8216#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {7843#true} assume !(~i~0 % 4294967296 < 102400); {7843#true} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {7843#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7843#true} is VALID [2022-04-15 05:42:13,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {7843#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {7843#true} is VALID [2022-04-15 05:42:13,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {7843#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {7843#true} is VALID [2022-04-15 05:42:13,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {7843#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {7843#true} is VALID [2022-04-15 05:42:13,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7843#true} {7843#true} #43#return; {7843#true} is VALID [2022-04-15 05:42:13,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {7843#true} assume true; {7843#true} is VALID [2022-04-15 05:42:13,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {7843#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {7843#true} is VALID [2022-04-15 05:42:13,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {7843#true} call ULTIMATE.init(); {7843#true} is VALID [2022-04-15 05:42:13,600 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-04-15 05:42:13,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655200457] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:13,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:13,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-15 05:42:13,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:13,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1677237760] [2022-04-15 05:42:13,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1677237760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:13,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:13,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 05:42:13,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485860039] [2022-04-15 05:42:13,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:13,601 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 05:42:13,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:13,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:13,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:13,627 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 05:42:13,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:13,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 05:42:13,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2022-04-15 05:42:13,627 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:14,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:14,815 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2022-04-15 05:42:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 05:42:14,815 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 05:42:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 93 transitions. [2022-04-15 05:42:14,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 93 transitions. [2022-04-15 05:42:14,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 93 transitions. [2022-04-15 05:42:14,879 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-15 05:42:14,880 INFO L225 Difference]: With dead ends: 127 [2022-04-15 05:42:14,880 INFO L226 Difference]: Without dead ends: 84 [2022-04-15 05:42:14,880 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=752, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 05:42:14,880 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 48 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:14,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 236 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 05:42:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-15 05:42:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2022-04-15 05:42:14,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:14,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:14,953 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:14,953 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:14,954 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2022-04-15 05:42:14,954 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2022-04-15 05:42:14,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:14,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:14,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-15 05:42:14,954 INFO L87 Difference]: Start difference. First operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-15 05:42:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:14,955 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2022-04-15 05:42:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2022-04-15 05:42:14,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:14,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:14,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:14,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2022-04-15 05:42:14,957 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 75 [2022-04-15 05:42:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:14,957 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2022-04-15 05:42:14,957 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:14,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 82 transitions. [2022-04-15 05:42:15,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-04-15 05:42:15,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 05:42:15,041 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:15,041 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:15,061 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-15 05:42:15,241 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,SelfDestructingSolverStorable14 [2022-04-15 05:42:15,242 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:15,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:15,242 INFO L85 PathProgramCache]: Analyzing trace with hash 407708556, now seen corresponding path program 27 times [2022-04-15 05:42:15,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:15,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [943481909] [2022-04-15 05:42:15,250 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:15,250 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:15,250 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:15,250 INFO L85 PathProgramCache]: Analyzing trace with hash 407708556, now seen corresponding path program 28 times [2022-04-15 05:42:15,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:15,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116339271] [2022-04-15 05:42:15,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:15,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:15,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:15,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {8933#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {8913#true} is VALID [2022-04-15 05:42:15,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {8913#true} assume true; {8913#true} is VALID [2022-04-15 05:42:15,507 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8913#true} {8913#true} #43#return; {8913#true} is VALID [2022-04-15 05:42:15,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {8913#true} call ULTIMATE.init(); {8933#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:15,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {8933#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {8913#true} is VALID [2022-04-15 05:42:15,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {8913#true} assume true; {8913#true} is VALID [2022-04-15 05:42:15,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8913#true} {8913#true} #43#return; {8913#true} is VALID [2022-04-15 05:42:15,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {8913#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {8913#true} is VALID [2022-04-15 05:42:15,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {8913#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {8918#(= main_~i~0 0)} is VALID [2022-04-15 05:42:15,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {8918#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8918#(= main_~i~0 0)} is VALID [2022-04-15 05:42:15,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {8918#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8919#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:15,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {8919#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8919#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:15,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {8919#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8920#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:15,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {8920#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8920#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:15,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {8920#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8921#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:15,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {8921#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8921#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:15,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {8921#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8922#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:15,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {8922#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8922#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:15,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {8922#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8923#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:15,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {8923#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8923#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:15,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {8923#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8924#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:15,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {8924#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8924#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:15,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {8924#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8925#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:15,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {8925#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8925#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:15,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {8925#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8926#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:15,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {8926#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8926#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:15,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {8926#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8927#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:15,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {8927#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8927#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:15,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {8927#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8928#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:15,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {8928#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8928#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:15,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {8928#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8929#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:15,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {8929#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8929#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:15,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {8929#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8930#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:15,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {8930#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8930#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:15,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {8930#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8931#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:15,519 INFO L290 TraceCheckUtils]: 32: Hoare triple {8931#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8931#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:15,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {8931#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8932#(and (<= main_~i~0 14) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:42:15,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {8932#(and (<= main_~i~0 14) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {8914#false} is VALID [2022-04-15 05:42:15,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {8914#false} ~i~0 := 0; {8914#false} is VALID [2022-04-15 05:42:15,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 41: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 42: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 43: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 44: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 45: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 47: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 48: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 49: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 51: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 52: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 54: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:15,520 INFO L290 TraceCheckUtils]: 55: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 56: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 57: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 58: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 59: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 60: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 61: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 62: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 63: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 64: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 65: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 66: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 67: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 68: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 69: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 70: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 71: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 72: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 73: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 74: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:15,521 INFO L290 TraceCheckUtils]: 75: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:15,522 INFO L290 TraceCheckUtils]: 76: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:15,522 INFO L290 TraceCheckUtils]: 77: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:15,522 INFO L290 TraceCheckUtils]: 78: Hoare triple {8914#false} assume !(~i~0 % 4294967296 < 102400); {8914#false} is VALID [2022-04-15 05:42:15,522 INFO L290 TraceCheckUtils]: 79: Hoare triple {8914#false} assume !false; {8914#false} is VALID [2022-04-15 05:42:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2022-04-15 05:42:15,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:15,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116339271] [2022-04-15 05:42:15,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116339271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:15,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458820455] [2022-04-15 05:42:15,522 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:42:15,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:15,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:15,523 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-15 05:42:15,524 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-15 05:42:15,746 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:42:15,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:15,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 05:42:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:15,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:16,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {8913#true} call ULTIMATE.init(); {8913#true} is VALID [2022-04-15 05:42:16,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {8913#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {8913#true} is VALID [2022-04-15 05:42:16,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {8913#true} assume true; {8913#true} is VALID [2022-04-15 05:42:16,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8913#true} {8913#true} #43#return; {8913#true} is VALID [2022-04-15 05:42:16,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {8913#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {8913#true} is VALID [2022-04-15 05:42:16,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {8913#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {8918#(= main_~i~0 0)} is VALID [2022-04-15 05:42:16,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {8918#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8918#(= main_~i~0 0)} is VALID [2022-04-15 05:42:16,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {8918#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8919#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:16,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {8919#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8919#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:16,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {8919#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8920#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:16,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {8920#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8920#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:16,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {8920#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8921#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:16,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {8921#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8921#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:16,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {8921#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8922#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:16,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {8922#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8922#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:16,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {8922#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8923#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:16,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {8923#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8923#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:16,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {8923#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8924#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:16,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {8924#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8924#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:16,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {8924#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8925#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:16,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {8925#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8925#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:16,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {8925#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8926#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:16,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {8926#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8926#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:16,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {8926#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8927#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:16,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {8927#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8927#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:16,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {8927#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8928#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:16,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {8928#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8928#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:16,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {8928#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8929#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:16,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {8929#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8929#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:16,126 INFO L290 TraceCheckUtils]: 29: Hoare triple {8929#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8930#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:16,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {8930#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8930#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:16,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {8930#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8931#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:16,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {8931#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {8931#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:16,128 INFO L290 TraceCheckUtils]: 33: Hoare triple {8931#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9036#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 05:42:16,128 INFO L290 TraceCheckUtils]: 34: Hoare triple {9036#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {8914#false} is VALID [2022-04-15 05:42:16,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {8914#false} ~i~0 := 0; {8914#false} is VALID [2022-04-15 05:42:16,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,128 INFO L290 TraceCheckUtils]: 41: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 42: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 43: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 44: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 46: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 47: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 51: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 52: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 53: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 54: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 55: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 56: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 57: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 58: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 59: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 60: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,129 INFO L290 TraceCheckUtils]: 61: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 62: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 63: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 64: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 65: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 66: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 67: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 68: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 69: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 70: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 71: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 72: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 73: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 74: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 75: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 76: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 77: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 78: Hoare triple {8914#false} assume !(~i~0 % 4294967296 < 102400); {8914#false} is VALID [2022-04-15 05:42:16,130 INFO L290 TraceCheckUtils]: 79: Hoare triple {8914#false} assume !false; {8914#false} is VALID [2022-04-15 05:42:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2022-04-15 05:42:16,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:16,670 INFO L290 TraceCheckUtils]: 79: Hoare triple {8914#false} assume !false; {8914#false} is VALID [2022-04-15 05:42:16,671 INFO L290 TraceCheckUtils]: 78: Hoare triple {8914#false} assume !(~i~0 % 4294967296 < 102400); {8914#false} is VALID [2022-04-15 05:42:16,671 INFO L290 TraceCheckUtils]: 77: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,671 INFO L290 TraceCheckUtils]: 76: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,671 INFO L290 TraceCheckUtils]: 75: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,671 INFO L290 TraceCheckUtils]: 74: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,671 INFO L290 TraceCheckUtils]: 73: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,671 INFO L290 TraceCheckUtils]: 72: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,671 INFO L290 TraceCheckUtils]: 71: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,671 INFO L290 TraceCheckUtils]: 70: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,671 INFO L290 TraceCheckUtils]: 69: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,671 INFO L290 TraceCheckUtils]: 68: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,671 INFO L290 TraceCheckUtils]: 67: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,671 INFO L290 TraceCheckUtils]: 66: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,671 INFO L290 TraceCheckUtils]: 65: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,671 INFO L290 TraceCheckUtils]: 64: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 63: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 62: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 61: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 60: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 59: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 58: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 57: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 56: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 55: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 54: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 53: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 52: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 51: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 50: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 49: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 48: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 47: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,672 INFO L290 TraceCheckUtils]: 46: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,673 INFO L290 TraceCheckUtils]: 43: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,673 INFO L290 TraceCheckUtils]: 42: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {8914#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8914#false} is VALID [2022-04-15 05:42:16,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {8914#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8914#false} is VALID [2022-04-15 05:42:16,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {8914#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {8914#false} is VALID [2022-04-15 05:42:16,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {8914#false} ~i~0 := 0; {8914#false} is VALID [2022-04-15 05:42:16,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {9310#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {8914#false} is VALID [2022-04-15 05:42:16,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {9314#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9310#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:42:16,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {9314#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9314#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {9321#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9314#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {9321#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9321#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {9328#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9321#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {9328#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9328#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {9335#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9328#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {9335#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9335#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {9342#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9335#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {9342#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9342#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {9349#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9342#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {9349#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9349#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {9356#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9349#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {9356#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9356#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {9363#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9356#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {9363#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9363#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {9370#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9363#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {9370#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9370#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {9377#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9370#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {9377#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9377#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {9384#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9377#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {9384#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9384#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {9391#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9384#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {9391#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9391#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {9398#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9391#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {9398#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9398#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {9405#(< (mod (+ main_~i~0 14) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9398#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {9405#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {9405#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {8913#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {9405#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 05:42:16,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {8913#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {8913#true} is VALID [2022-04-15 05:42:16,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8913#true} {8913#true} #43#return; {8913#true} is VALID [2022-04-15 05:42:16,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {8913#true} assume true; {8913#true} is VALID [2022-04-15 05:42:16,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {8913#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {8913#true} is VALID [2022-04-15 05:42:16,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {8913#true} call ULTIMATE.init(); {8913#true} is VALID [2022-04-15 05:42:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2022-04-15 05:42:16,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458820455] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:16,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:16,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-15 05:42:16,693 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:16,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [943481909] [2022-04-15 05:42:16,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [943481909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:16,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:16,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 05:42:16,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905169853] [2022-04-15 05:42:16,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:16,693 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-15 05:42:16,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:16,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:16,727 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-15 05:42:16,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 05:42:16,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:16,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 05:42:16,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 05:42:16,728 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:18,008 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2022-04-15 05:42:18,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 05:42:18,008 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-15 05:42:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2022-04-15 05:42:18,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2022-04-15 05:42:18,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 98 transitions. [2022-04-15 05:42:18,073 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-15 05:42:18,083 INFO L225 Difference]: With dead ends: 135 [2022-04-15 05:42:18,083 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 05:42:18,085 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=340, Invalid=850, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 05:42:18,086 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 53 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:18,086 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 263 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 05:42:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 05:42:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-04-15 05:42:18,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:18,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:18,158 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:18,159 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:18,163 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-04-15 05:42:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-15 05:42:18,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:18,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:18,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-15 05:42:18,164 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-15 05:42:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:18,165 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-04-15 05:42:18,165 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-15 05:42:18,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:18,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:18,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:18,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2022-04-15 05:42:18,167 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 80 [2022-04-15 05:42:18,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:18,167 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2022-04-15 05:42:18,167 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:18,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 87 transitions. [2022-04-15 05:42:18,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2022-04-15 05:42:18,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 05:42:18,226 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:18,226 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:18,242 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-15 05:42:18,426 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:18,426 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:18,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:18,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1855190807, now seen corresponding path program 29 times [2022-04-15 05:42:18,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:18,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1045635646] [2022-04-15 05:42:18,437 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:18,437 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:18,437 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:18,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1855190807, now seen corresponding path program 30 times [2022-04-15 05:42:18,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:18,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266272857] [2022-04-15 05:42:18,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:18,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:18,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:18,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {10072#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {10051#true} is VALID [2022-04-15 05:42:18,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {10051#true} assume true; {10051#true} is VALID [2022-04-15 05:42:18,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10051#true} {10051#true} #43#return; {10051#true} is VALID [2022-04-15 05:42:18,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {10051#true} call ULTIMATE.init(); {10072#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:18,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {10072#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {10051#true} is VALID [2022-04-15 05:42:18,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {10051#true} assume true; {10051#true} is VALID [2022-04-15 05:42:18,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10051#true} {10051#true} #43#return; {10051#true} is VALID [2022-04-15 05:42:18,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {10051#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {10051#true} is VALID [2022-04-15 05:42:18,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {10051#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {10056#(= main_~i~0 0)} is VALID [2022-04-15 05:42:18,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {10056#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10056#(= main_~i~0 0)} is VALID [2022-04-15 05:42:18,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {10056#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10057#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:18,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {10057#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10057#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:18,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {10057#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10058#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:18,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {10058#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10058#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:18,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {10058#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10059#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:18,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {10059#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10059#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:18,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {10059#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10060#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:18,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {10060#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10060#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:18,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {10060#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10061#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:18,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {10061#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10061#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:18,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {10061#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10062#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:18,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {10062#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10062#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:18,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {10062#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10063#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:18,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {10063#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10063#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:18,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {10063#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10064#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:18,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {10064#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10064#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:18,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {10064#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10065#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:18,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {10065#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10065#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:18,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {10065#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10066#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:18,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {10066#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10066#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:18,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {10066#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10067#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:18,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {10067#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10067#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:18,745 INFO L290 TraceCheckUtils]: 29: Hoare triple {10067#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10068#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:18,745 INFO L290 TraceCheckUtils]: 30: Hoare triple {10068#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10068#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:18,745 INFO L290 TraceCheckUtils]: 31: Hoare triple {10068#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10069#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:18,746 INFO L290 TraceCheckUtils]: 32: Hoare triple {10069#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10069#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:18,746 INFO L290 TraceCheckUtils]: 33: Hoare triple {10069#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10070#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 05:42:18,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {10070#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10070#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 05:42:18,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {10070#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10071#(and (<= main_~i~0 15) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:42:18,748 INFO L290 TraceCheckUtils]: 36: Hoare triple {10071#(and (<= main_~i~0 15) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {10052#false} is VALID [2022-04-15 05:42:18,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {10052#false} ~i~0 := 0; {10052#false} is VALID [2022-04-15 05:42:18,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:18,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:18,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:18,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:18,748 INFO L290 TraceCheckUtils]: 42: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:18,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:18,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:18,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:18,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:18,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:18,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:18,748 INFO L290 TraceCheckUtils]: 49: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 50: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 51: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 52: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 55: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 56: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 57: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 58: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 59: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 60: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 61: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 62: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 63: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 64: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 65: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 66: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 67: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 68: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:18,749 INFO L290 TraceCheckUtils]: 69: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:18,750 INFO L290 TraceCheckUtils]: 70: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:18,750 INFO L290 TraceCheckUtils]: 71: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:18,750 INFO L290 TraceCheckUtils]: 72: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:18,750 INFO L290 TraceCheckUtils]: 73: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:18,750 INFO L290 TraceCheckUtils]: 74: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:18,750 INFO L290 TraceCheckUtils]: 75: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:18,750 INFO L290 TraceCheckUtils]: 76: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:18,750 INFO L290 TraceCheckUtils]: 77: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:18,750 INFO L290 TraceCheckUtils]: 78: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:18,750 INFO L290 TraceCheckUtils]: 79: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:18,750 INFO L290 TraceCheckUtils]: 80: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:18,750 INFO L290 TraceCheckUtils]: 81: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:18,750 INFO L290 TraceCheckUtils]: 82: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:18,750 INFO L290 TraceCheckUtils]: 83: Hoare triple {10052#false} assume !(~i~0 % 4294967296 < 102400); {10052#false} is VALID [2022-04-15 05:42:18,750 INFO L290 TraceCheckUtils]: 84: Hoare triple {10052#false} assume !false; {10052#false} is VALID [2022-04-15 05:42:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2022-04-15 05:42:18,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:18,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266272857] [2022-04-15 05:42:18,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266272857] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:18,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988587707] [2022-04-15 05:42:18,751 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:42:18,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:18,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:18,752 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-15 05:42:18,753 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-15 05:42:45,187 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-15 05:42:45,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:45,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 05:42:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:45,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:45,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {10051#true} call ULTIMATE.init(); {10051#true} is VALID [2022-04-15 05:42:45,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {10051#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {10051#true} is VALID [2022-04-15 05:42:45,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {10051#true} assume true; {10051#true} is VALID [2022-04-15 05:42:45,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10051#true} {10051#true} #43#return; {10051#true} is VALID [2022-04-15 05:42:45,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {10051#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {10051#true} is VALID [2022-04-15 05:42:45,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {10051#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {10056#(= main_~i~0 0)} is VALID [2022-04-15 05:42:45,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {10056#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10056#(= main_~i~0 0)} is VALID [2022-04-15 05:42:45,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {10056#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10057#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:45,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {10057#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10057#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:45,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {10057#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10058#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:45,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {10058#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10058#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:45,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {10058#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10059#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:45,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {10059#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10059#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:45,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {10059#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10060#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:45,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {10060#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10060#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:45,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {10060#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10061#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:45,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {10061#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10061#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:45,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {10061#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10062#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:45,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {10062#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10062#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:45,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {10062#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10063#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:45,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {10063#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10063#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:45,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {10063#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10064#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:45,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {10064#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10064#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:45,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {10064#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10065#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:45,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {10065#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10065#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:45,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {10065#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10066#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:45,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {10066#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10066#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:45,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {10066#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10067#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:45,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {10067#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10067#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:45,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {10067#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10068#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:45,638 INFO L290 TraceCheckUtils]: 30: Hoare triple {10068#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10068#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:45,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {10068#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10069#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:45,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {10069#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10069#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:45,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {10069#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10070#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 05:42:45,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {10070#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10070#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 05:42:45,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {10070#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10181#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 05:42:45,641 INFO L290 TraceCheckUtils]: 36: Hoare triple {10181#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !(~i~0 % 4294967296 < 102400); {10052#false} is VALID [2022-04-15 05:42:45,641 INFO L290 TraceCheckUtils]: 37: Hoare triple {10052#false} ~i~0 := 0; {10052#false} is VALID [2022-04-15 05:42:45,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:45,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:45,641 INFO L290 TraceCheckUtils]: 40: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:45,641 INFO L290 TraceCheckUtils]: 41: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:45,641 INFO L290 TraceCheckUtils]: 42: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:45,641 INFO L290 TraceCheckUtils]: 43: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:45,641 INFO L290 TraceCheckUtils]: 44: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:45,641 INFO L290 TraceCheckUtils]: 45: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:45,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:45,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 48: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 49: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 50: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 51: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 52: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 53: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 54: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 55: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 56: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 57: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 58: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 59: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 60: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 61: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 62: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 63: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 64: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:45,642 INFO L290 TraceCheckUtils]: 65: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 66: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 67: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 68: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 69: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 70: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 71: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 72: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 73: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 74: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 75: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 76: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 77: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 78: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 79: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 80: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 81: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 82: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:45,643 INFO L290 TraceCheckUtils]: 83: Hoare triple {10052#false} assume !(~i~0 % 4294967296 < 102400); {10052#false} is VALID [2022-04-15 05:42:45,644 INFO L290 TraceCheckUtils]: 84: Hoare triple {10052#false} assume !false; {10052#false} is VALID [2022-04-15 05:42:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2022-04-15 05:42:45,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:46,230 INFO L290 TraceCheckUtils]: 84: Hoare triple {10052#false} assume !false; {10052#false} is VALID [2022-04-15 05:42:46,230 INFO L290 TraceCheckUtils]: 83: Hoare triple {10052#false} assume !(~i~0 % 4294967296 < 102400); {10052#false} is VALID [2022-04-15 05:42:46,230 INFO L290 TraceCheckUtils]: 82: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:46,230 INFO L290 TraceCheckUtils]: 81: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:46,230 INFO L290 TraceCheckUtils]: 80: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:46,230 INFO L290 TraceCheckUtils]: 79: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:46,230 INFO L290 TraceCheckUtils]: 78: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:46,230 INFO L290 TraceCheckUtils]: 77: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 76: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 75: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 74: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 73: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 72: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 71: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 70: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 69: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 68: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 67: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 66: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 65: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 64: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 63: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 62: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 61: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 60: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 59: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:46,231 INFO L290 TraceCheckUtils]: 58: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 55: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 54: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 53: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 52: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 51: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 50: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 49: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 48: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 47: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 46: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 45: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 44: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 43: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {10052#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10052#false} is VALID [2022-04-15 05:42:46,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {10052#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10052#false} is VALID [2022-04-15 05:42:46,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {10052#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {10052#false} is VALID [2022-04-15 05:42:46,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {10052#false} ~i~0 := 0; {10052#false} is VALID [2022-04-15 05:42:46,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {10473#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {10052#false} is VALID [2022-04-15 05:42:46,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {10477#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10473#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:42:46,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {10477#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10477#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {10484#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10477#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {10484#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10484#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {10491#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10484#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {10491#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10491#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {10498#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10491#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {10498#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10498#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {10505#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10498#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {10505#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10505#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {10512#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10505#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {10512#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10512#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {10519#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10512#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {10519#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10519#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {10526#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10519#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {10526#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10526#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {10533#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10526#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {10533#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10533#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {10540#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10533#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {10540#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10540#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {10547#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10540#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {10547#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10547#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {10554#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10547#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {10554#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10554#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {10561#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10554#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {10561#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10561#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {10568#(< (mod (+ main_~i~0 14) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10561#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {10568#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10568#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {10575#(< (mod (+ main_~i~0 15) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10568#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {10575#(< (mod (+ main_~i~0 15) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {10575#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {10051#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {10575#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 05:42:46,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {10051#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {10051#true} is VALID [2022-04-15 05:42:46,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10051#true} {10051#true} #43#return; {10051#true} is VALID [2022-04-15 05:42:46,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {10051#true} assume true; {10051#true} is VALID [2022-04-15 05:42:46,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {10051#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {10051#true} is VALID [2022-04-15 05:42:46,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {10051#true} call ULTIMATE.init(); {10051#true} is VALID [2022-04-15 05:42:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2022-04-15 05:42:46,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988587707] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:46,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:46,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-15 05:42:46,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:46,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1045635646] [2022-04-15 05:42:46,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1045635646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:46,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:46,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 05:42:46,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557870547] [2022-04-15 05:42:46,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:46,247 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-15 05:42:46,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:46,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:46,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:46,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 05:42:46,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:46,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 05:42:46,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=903, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 05:42:46,286 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:47,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:47,681 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2022-04-15 05:42:47,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 05:42:47,681 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-15 05:42:47,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 103 transitions. [2022-04-15 05:42:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 103 transitions. [2022-04-15 05:42:47,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 103 transitions. [2022-04-15 05:42:47,748 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-15 05:42:47,749 INFO L225 Difference]: With dead ends: 143 [2022-04-15 05:42:47,749 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 05:42:47,750 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=954, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 05:42:47,750 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 68 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:47,750 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 267 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 05:42:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 05:42:47,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-15 05:42:47,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:47,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:47,817 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:47,817 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:47,818 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-04-15 05:42:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2022-04-15 05:42:47,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:47,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:47,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-15 05:42:47,819 INFO L87 Difference]: Start difference. First operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-15 05:42:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:47,820 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-04-15 05:42:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2022-04-15 05:42:47,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:47,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:47,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:47,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:47,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2022-04-15 05:42:47,821 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 85 [2022-04-15 05:42:47,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:47,821 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2022-04-15 05:42:47,821 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:47,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 92 transitions. [2022-04-15 05:42:47,890 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-15 05:42:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2022-04-15 05:42:47,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-15 05:42:47,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:47,891 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:47,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:48,091 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,SelfDestructingSolverStorable16 [2022-04-15 05:42:48,092 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:48,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:48,095 INFO L85 PathProgramCache]: Analyzing trace with hash 741309552, now seen corresponding path program 31 times [2022-04-15 05:42:48,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:48,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [549553622] [2022-04-15 05:42:48,103 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:48,103 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:48,104 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:48,104 INFO L85 PathProgramCache]: Analyzing trace with hash 741309552, now seen corresponding path program 32 times [2022-04-15 05:42:48,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:48,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147425727] [2022-04-15 05:42:48,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:48,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:48,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:48,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {11279#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {11257#true} is VALID [2022-04-15 05:42:48,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {11257#true} assume true; {11257#true} is VALID [2022-04-15 05:42:48,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11257#true} {11257#true} #43#return; {11257#true} is VALID [2022-04-15 05:42:48,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {11257#true} call ULTIMATE.init(); {11279#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:48,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {11279#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {11257#true} is VALID [2022-04-15 05:42:48,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {11257#true} assume true; {11257#true} is VALID [2022-04-15 05:42:48,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11257#true} {11257#true} #43#return; {11257#true} is VALID [2022-04-15 05:42:48,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {11257#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {11257#true} is VALID [2022-04-15 05:42:48,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {11257#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {11262#(= main_~i~0 0)} is VALID [2022-04-15 05:42:48,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {11262#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11262#(= main_~i~0 0)} is VALID [2022-04-15 05:42:48,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {11262#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:48,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:48,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:48,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:48,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:48,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:48,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:48,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:48,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:48,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:48,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:48,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:48,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:48,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:48,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:48,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:48,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:48,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:48,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:48,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:48,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:48,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:48,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:48,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:48,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:48,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:48,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 05:42:48,411 INFO L290 TraceCheckUtils]: 34: Hoare triple {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 05:42:48,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 05:42:48,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 05:42:48,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11278#(and (<= main_~i~0 16) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:42:48,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {11278#(and (<= main_~i~0 16) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {11258#false} is VALID [2022-04-15 05:42:48,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {11258#false} ~i~0 := 0; {11258#false} is VALID [2022-04-15 05:42:48,412 INFO L290 TraceCheckUtils]: 40: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 42: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 43: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 44: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 45: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 46: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 47: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 48: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 49: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 50: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 51: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 52: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 53: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 54: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 55: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 56: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 57: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 58: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 59: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-15 05:42:48,413 INFO L290 TraceCheckUtils]: 60: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 61: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 62: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 63: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 64: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 65: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 66: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 67: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 68: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 69: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 70: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 71: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 72: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 73: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 74: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 75: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 76: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 77: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 78: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-15 05:42:48,414 INFO L290 TraceCheckUtils]: 79: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-15 05:42:48,415 INFO L290 TraceCheckUtils]: 80: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-15 05:42:48,415 INFO L290 TraceCheckUtils]: 81: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-15 05:42:48,415 INFO L290 TraceCheckUtils]: 82: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-15 05:42:48,415 INFO L290 TraceCheckUtils]: 83: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-15 05:42:48,415 INFO L290 TraceCheckUtils]: 84: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-15 05:42:48,415 INFO L290 TraceCheckUtils]: 85: Hoare triple {11258#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11258#false} is VALID [2022-04-15 05:42:48,415 INFO L290 TraceCheckUtils]: 86: Hoare triple {11258#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11258#false} is VALID [2022-04-15 05:42:48,415 INFO L290 TraceCheckUtils]: 87: Hoare triple {11258#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11258#false} is VALID [2022-04-15 05:42:48,415 INFO L290 TraceCheckUtils]: 88: Hoare triple {11258#false} assume !(~i~0 % 4294967296 < 102400); {11258#false} is VALID [2022-04-15 05:42:48,415 INFO L290 TraceCheckUtils]: 89: Hoare triple {11258#false} assume !false; {11258#false} is VALID [2022-04-15 05:42:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2022-04-15 05:42:48,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:48,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147425727] [2022-04-15 05:42:48,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147425727] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:48,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756021919] [2022-04-15 05:42:48,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:48,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:48,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:48,417 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-15 05:42:48,417 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-15 05:42:49,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:49,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:49,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 05:42:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:49,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:49,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {11257#true} call ULTIMATE.init(); {11257#true} is VALID [2022-04-15 05:42:49,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {11257#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {11257#true} assume true; {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11257#true} {11257#true} #43#return; {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {11257#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {11257#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:49,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:49,682 INFO L290 TraceCheckUtils]: 38: Hoare triple {11257#true} assume !(~i~0 % 4294967296 < 102400); {11257#true} is VALID [2022-04-15 05:42:49,683 INFO L290 TraceCheckUtils]: 39: Hoare triple {11257#true} ~i~0 := 0; {11262#(= main_~i~0 0)} is VALID [2022-04-15 05:42:49,683 INFO L290 TraceCheckUtils]: 40: Hoare triple {11262#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11262#(= main_~i~0 0)} is VALID [2022-04-15 05:42:49,683 INFO L290 TraceCheckUtils]: 41: Hoare triple {11262#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11262#(= main_~i~0 0)} is VALID [2022-04-15 05:42:49,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {11262#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:49,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:49,684 INFO L290 TraceCheckUtils]: 44: Hoare triple {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:49,685 INFO L290 TraceCheckUtils]: 45: Hoare triple {11263#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:49,685 INFO L290 TraceCheckUtils]: 46: Hoare triple {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:49,685 INFO L290 TraceCheckUtils]: 47: Hoare triple {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:49,686 INFO L290 TraceCheckUtils]: 48: Hoare triple {11264#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:49,686 INFO L290 TraceCheckUtils]: 49: Hoare triple {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:49,686 INFO L290 TraceCheckUtils]: 50: Hoare triple {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:49,687 INFO L290 TraceCheckUtils]: 51: Hoare triple {11265#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:49,687 INFO L290 TraceCheckUtils]: 52: Hoare triple {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:49,687 INFO L290 TraceCheckUtils]: 53: Hoare triple {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:49,688 INFO L290 TraceCheckUtils]: 54: Hoare triple {11266#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:49,688 INFO L290 TraceCheckUtils]: 55: Hoare triple {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:49,688 INFO L290 TraceCheckUtils]: 56: Hoare triple {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:49,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {11267#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:49,689 INFO L290 TraceCheckUtils]: 58: Hoare triple {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:49,689 INFO L290 TraceCheckUtils]: 59: Hoare triple {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:49,690 INFO L290 TraceCheckUtils]: 60: Hoare triple {11268#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:49,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:49,690 INFO L290 TraceCheckUtils]: 62: Hoare triple {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:49,691 INFO L290 TraceCheckUtils]: 63: Hoare triple {11269#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:49,691 INFO L290 TraceCheckUtils]: 64: Hoare triple {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:49,691 INFO L290 TraceCheckUtils]: 65: Hoare triple {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:49,692 INFO L290 TraceCheckUtils]: 66: Hoare triple {11270#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:49,692 INFO L290 TraceCheckUtils]: 67: Hoare triple {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:49,692 INFO L290 TraceCheckUtils]: 68: Hoare triple {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:49,693 INFO L290 TraceCheckUtils]: 69: Hoare triple {11271#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:49,693 INFO L290 TraceCheckUtils]: 70: Hoare triple {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:49,693 INFO L290 TraceCheckUtils]: 71: Hoare triple {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:49,694 INFO L290 TraceCheckUtils]: 72: Hoare triple {11272#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:49,694 INFO L290 TraceCheckUtils]: 73: Hoare triple {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:49,694 INFO L290 TraceCheckUtils]: 74: Hoare triple {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:49,695 INFO L290 TraceCheckUtils]: 75: Hoare triple {11273#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:49,695 INFO L290 TraceCheckUtils]: 76: Hoare triple {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:49,695 INFO L290 TraceCheckUtils]: 77: Hoare triple {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:49,696 INFO L290 TraceCheckUtils]: 78: Hoare triple {11274#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:49,696 INFO L290 TraceCheckUtils]: 79: Hoare triple {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:49,696 INFO L290 TraceCheckUtils]: 80: Hoare triple {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:49,697 INFO L290 TraceCheckUtils]: 81: Hoare triple {11275#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 05:42:49,697 INFO L290 TraceCheckUtils]: 82: Hoare triple {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 05:42:49,697 INFO L290 TraceCheckUtils]: 83: Hoare triple {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 05:42:49,698 INFO L290 TraceCheckUtils]: 84: Hoare triple {11276#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 05:42:49,698 INFO L290 TraceCheckUtils]: 85: Hoare triple {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 05:42:49,698 INFO L290 TraceCheckUtils]: 86: Hoare triple {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 05:42:49,699 INFO L290 TraceCheckUtils]: 87: Hoare triple {11277#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11544#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 05:42:49,699 INFO L290 TraceCheckUtils]: 88: Hoare triple {11544#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {11258#false} is VALID [2022-04-15 05:42:49,699 INFO L290 TraceCheckUtils]: 89: Hoare triple {11258#false} assume !false; {11258#false} is VALID [2022-04-15 05:42:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-04-15 05:42:49,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:50,308 INFO L290 TraceCheckUtils]: 89: Hoare triple {11258#false} assume !false; {11258#false} is VALID [2022-04-15 05:42:50,308 INFO L290 TraceCheckUtils]: 88: Hoare triple {11554#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {11258#false} is VALID [2022-04-15 05:42:50,309 INFO L290 TraceCheckUtils]: 87: Hoare triple {11558#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11554#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:42:50,309 INFO L290 TraceCheckUtils]: 86: Hoare triple {11558#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11558#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,309 INFO L290 TraceCheckUtils]: 85: Hoare triple {11558#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11558#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,310 INFO L290 TraceCheckUtils]: 84: Hoare triple {11568#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11558#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,310 INFO L290 TraceCheckUtils]: 83: Hoare triple {11568#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11568#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,310 INFO L290 TraceCheckUtils]: 82: Hoare triple {11568#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11568#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,311 INFO L290 TraceCheckUtils]: 81: Hoare triple {11578#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11568#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,311 INFO L290 TraceCheckUtils]: 80: Hoare triple {11578#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11578#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,311 INFO L290 TraceCheckUtils]: 79: Hoare triple {11578#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11578#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,312 INFO L290 TraceCheckUtils]: 78: Hoare triple {11588#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11578#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,312 INFO L290 TraceCheckUtils]: 77: Hoare triple {11588#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11588#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,312 INFO L290 TraceCheckUtils]: 76: Hoare triple {11588#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11588#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,313 INFO L290 TraceCheckUtils]: 75: Hoare triple {11598#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11588#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,313 INFO L290 TraceCheckUtils]: 74: Hoare triple {11598#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11598#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,314 INFO L290 TraceCheckUtils]: 73: Hoare triple {11598#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11598#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,314 INFO L290 TraceCheckUtils]: 72: Hoare triple {11608#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11598#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,314 INFO L290 TraceCheckUtils]: 71: Hoare triple {11608#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11608#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {11608#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11608#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,315 INFO L290 TraceCheckUtils]: 69: Hoare triple {11618#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11608#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,315 INFO L290 TraceCheckUtils]: 68: Hoare triple {11618#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11618#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,316 INFO L290 TraceCheckUtils]: 67: Hoare triple {11618#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11618#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,316 INFO L290 TraceCheckUtils]: 66: Hoare triple {11628#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11618#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,316 INFO L290 TraceCheckUtils]: 65: Hoare triple {11628#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11628#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,317 INFO L290 TraceCheckUtils]: 64: Hoare triple {11628#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11628#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,317 INFO L290 TraceCheckUtils]: 63: Hoare triple {11638#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11628#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,317 INFO L290 TraceCheckUtils]: 62: Hoare triple {11638#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11638#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {11638#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11638#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,318 INFO L290 TraceCheckUtils]: 60: Hoare triple {11648#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11638#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,318 INFO L290 TraceCheckUtils]: 59: Hoare triple {11648#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11648#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,319 INFO L290 TraceCheckUtils]: 58: Hoare triple {11648#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11648#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,319 INFO L290 TraceCheckUtils]: 57: Hoare triple {11658#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11648#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {11658#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11658#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,320 INFO L290 TraceCheckUtils]: 55: Hoare triple {11658#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11658#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {11668#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11658#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {11668#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11668#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,321 INFO L290 TraceCheckUtils]: 52: Hoare triple {11668#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11668#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,321 INFO L290 TraceCheckUtils]: 51: Hoare triple {11678#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11668#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,321 INFO L290 TraceCheckUtils]: 50: Hoare triple {11678#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11678#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,322 INFO L290 TraceCheckUtils]: 49: Hoare triple {11678#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11678#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,322 INFO L290 TraceCheckUtils]: 48: Hoare triple {11688#(< (mod (+ main_~i~0 14) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11678#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,322 INFO L290 TraceCheckUtils]: 47: Hoare triple {11688#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11688#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,323 INFO L290 TraceCheckUtils]: 46: Hoare triple {11688#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11688#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {11698#(< (mod (+ main_~i~0 15) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11688#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {11698#(< (mod (+ main_~i~0 15) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11698#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,324 INFO L290 TraceCheckUtils]: 43: Hoare triple {11698#(< (mod (+ main_~i~0 15) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11698#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {11708#(< (mod (+ main_~i~0 16) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11698#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,324 INFO L290 TraceCheckUtils]: 41: Hoare triple {11708#(< (mod (+ main_~i~0 16) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11708#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {11708#(< (mod (+ main_~i~0 16) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11708#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {11257#true} ~i~0 := 0; {11708#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 05:42:50,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {11257#true} assume !(~i~0 % 4294967296 < 102400); {11257#true} is VALID [2022-04-15 05:42:50,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:50,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:50,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:50,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:50,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:50,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:50,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:50,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:50,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:50,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:50,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:50,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:50,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {11257#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11257#true} is VALID [2022-04-15 05:42:50,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {11257#true} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {11257#true} is VALID [2022-04-15 05:42:50,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {11257#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {11257#true} is VALID [2022-04-15 05:42:50,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {11257#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {11257#true} is VALID [2022-04-15 05:42:50,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11257#true} {11257#true} #43#return; {11257#true} is VALID [2022-04-15 05:42:50,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {11257#true} assume true; {11257#true} is VALID [2022-04-15 05:42:50,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {11257#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {11257#true} is VALID [2022-04-15 05:42:50,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {11257#true} call ULTIMATE.init(); {11257#true} is VALID [2022-04-15 05:42:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-04-15 05:42:50,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756021919] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:50,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:50,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-15 05:42:50,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:50,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [549553622] [2022-04-15 05:42:50,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [549553622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:50,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:50,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 05:42:50,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658396709] [2022-04-15 05:42:50,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:50,328 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-15 05:42:50,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:50,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:50,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:50,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 05:42:50,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:50,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 05:42:50,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1010, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 05:42:50,359 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:52,027 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2022-04-15 05:42:52,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 05:42:52,027 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-15 05:42:52,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 108 transitions. [2022-04-15 05:42:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 108 transitions. [2022-04-15 05:42:52,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 108 transitions. [2022-04-15 05:42:52,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:52,126 INFO L225 Difference]: With dead ends: 151 [2022-04-15 05:42:52,126 INFO L226 Difference]: Without dead ends: 99 [2022-04-15 05:42:52,128 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=418, Invalid=1064, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 05:42:52,128 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 65 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:52,128 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 318 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 05:42:52,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-15 05:42:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2022-04-15 05:42:52,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:52,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:52,200 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:52,201 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:52,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:52,202 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2022-04-15 05:42:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-04-15 05:42:52,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:52,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:52,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-15 05:42:52,203 INFO L87 Difference]: Start difference. First operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-15 05:42:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:52,204 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2022-04-15 05:42:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-04-15 05:42:52,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:52,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:52,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:52,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2022-04-15 05:42:52,206 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 90 [2022-04-15 05:42:52,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:52,206 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2022-04-15 05:42:52,206 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:52,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 97 transitions. [2022-04-15 05:42:52,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2022-04-15 05:42:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 05:42:52,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:52,277 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:52,317 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-15 05:42:52,491 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 05:42:52,491 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:52,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1721038853, now seen corresponding path program 33 times [2022-04-15 05:42:52,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:52,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1181060048] [2022-04-15 05:42:52,499 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:52,499 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:52,499 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:52,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1721038853, now seen corresponding path program 34 times [2022-04-15 05:42:52,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:52,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250762096] [2022-04-15 05:42:52,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:52,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:52,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:52,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {12554#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {12531#true} is VALID [2022-04-15 05:42:52,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {12531#true} assume true; {12531#true} is VALID [2022-04-15 05:42:52,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12531#true} {12531#true} #43#return; {12531#true} is VALID [2022-04-15 05:42:52,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {12531#true} call ULTIMATE.init(); {12554#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:52,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {12554#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {12531#true} is VALID [2022-04-15 05:42:52,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {12531#true} assume true; {12531#true} is VALID [2022-04-15 05:42:52,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12531#true} {12531#true} #43#return; {12531#true} is VALID [2022-04-15 05:42:52,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {12531#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {12531#true} is VALID [2022-04-15 05:42:52,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {12531#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {12536#(= main_~i~0 0)} is VALID [2022-04-15 05:42:52,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {12536#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12536#(= main_~i~0 0)} is VALID [2022-04-15 05:42:52,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {12536#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12537#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:52,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {12537#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12537#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:52,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {12537#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12538#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:52,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {12538#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12538#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:52,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {12538#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12539#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:52,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {12539#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12539#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:52,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {12539#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12540#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:52,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {12540#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12540#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:52,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {12540#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12541#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:52,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {12541#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12541#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:52,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {12541#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12542#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:52,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {12542#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12542#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:52,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {12542#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12543#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:52,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {12543#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12543#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:52,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {12543#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12544#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:52,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {12544#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12544#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:52,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {12544#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12545#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:52,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {12545#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12545#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:52,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {12545#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12546#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:52,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {12546#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12546#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:52,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {12546#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12547#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:52,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {12547#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12547#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:52,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {12547#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12548#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:52,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {12548#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12548#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:52,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {12548#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12549#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:52,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {12549#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12549#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:52,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {12549#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12550#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 05:42:52,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {12550#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12550#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 05:42:52,853 INFO L290 TraceCheckUtils]: 35: Hoare triple {12550#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12551#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 05:42:52,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {12551#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12551#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 05:42:52,854 INFO L290 TraceCheckUtils]: 37: Hoare triple {12551#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12552#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 05:42:52,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {12552#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12552#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 05:42:52,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {12552#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12553#(and (<= main_~i~0 17) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:42:52,855 INFO L290 TraceCheckUtils]: 40: Hoare triple {12553#(and (<= main_~i~0 17) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {12532#false} is VALID [2022-04-15 05:42:52,855 INFO L290 TraceCheckUtils]: 41: Hoare triple {12532#false} ~i~0 := 0; {12532#false} is VALID [2022-04-15 05:42:52,855 INFO L290 TraceCheckUtils]: 42: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,855 INFO L290 TraceCheckUtils]: 43: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,855 INFO L290 TraceCheckUtils]: 44: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,855 INFO L290 TraceCheckUtils]: 45: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,855 INFO L290 TraceCheckUtils]: 46: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,855 INFO L290 TraceCheckUtils]: 47: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,855 INFO L290 TraceCheckUtils]: 48: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,855 INFO L290 TraceCheckUtils]: 49: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,855 INFO L290 TraceCheckUtils]: 50: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,855 INFO L290 TraceCheckUtils]: 51: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,855 INFO L290 TraceCheckUtils]: 52: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 54: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 55: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 57: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 58: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 59: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 60: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 61: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 62: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 63: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 64: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 65: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 66: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 67: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 68: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 69: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 70: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 71: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,856 INFO L290 TraceCheckUtils]: 72: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 73: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 74: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 75: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 76: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 77: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 78: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 79: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 80: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 81: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 82: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 83: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 84: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 85: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 86: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 87: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 88: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 89: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 90: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:52,857 INFO L290 TraceCheckUtils]: 91: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:52,858 INFO L290 TraceCheckUtils]: 92: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:52,858 INFO L290 TraceCheckUtils]: 93: Hoare triple {12532#false} assume !(~i~0 % 4294967296 < 102400); {12532#false} is VALID [2022-04-15 05:42:52,858 INFO L290 TraceCheckUtils]: 94: Hoare triple {12532#false} assume !false; {12532#false} is VALID [2022-04-15 05:42:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-04-15 05:42:52,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:52,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250762096] [2022-04-15 05:42:52,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250762096] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:52,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540078807] [2022-04-15 05:42:52,858 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:42:52,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:52,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:52,859 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:52,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 05:42:53,489 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:42:53,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:53,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 05:42:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:53,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:53,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {12531#true} call ULTIMATE.init(); {12531#true} is VALID [2022-04-15 05:42:53,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {12531#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {12531#true} is VALID [2022-04-15 05:42:53,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {12531#true} assume true; {12531#true} is VALID [2022-04-15 05:42:53,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12531#true} {12531#true} #43#return; {12531#true} is VALID [2022-04-15 05:42:53,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {12531#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {12531#true} is VALID [2022-04-15 05:42:53,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {12531#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {12536#(= main_~i~0 0)} is VALID [2022-04-15 05:42:53,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {12536#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12536#(= main_~i~0 0)} is VALID [2022-04-15 05:42:53,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {12536#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12537#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:53,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {12537#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12537#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:53,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {12537#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12538#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:53,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {12538#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12538#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:53,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {12538#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12539#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:53,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {12539#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12539#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:53,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {12539#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12540#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:53,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {12540#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12540#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:53,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {12540#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12541#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:53,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {12541#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12541#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:53,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {12541#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12542#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:53,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {12542#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12542#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:53,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {12542#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12543#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:53,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {12543#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12543#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:53,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {12543#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12544#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:53,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {12544#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12544#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:53,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {12544#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12545#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:53,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {12545#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12545#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:53,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {12545#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12546#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:53,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {12546#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12546#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:53,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {12546#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12547#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:53,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {12547#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12547#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:53,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {12547#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12548#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:53,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {12548#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12548#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:53,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {12548#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12549#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:53,958 INFO L290 TraceCheckUtils]: 32: Hoare triple {12549#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12549#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:53,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {12549#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12550#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 05:42:53,959 INFO L290 TraceCheckUtils]: 34: Hoare triple {12550#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12550#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 05:42:53,960 INFO L290 TraceCheckUtils]: 35: Hoare triple {12550#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12551#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 05:42:53,960 INFO L290 TraceCheckUtils]: 36: Hoare triple {12551#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12551#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 05:42:53,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {12551#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12552#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 05:42:53,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {12552#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {12552#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 05:42:53,961 INFO L290 TraceCheckUtils]: 39: Hoare triple {12552#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12675#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 05:42:53,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {12675#(and (<= 17 main_~i~0) (<= main_~i~0 17))} assume !(~i~0 % 4294967296 < 102400); {12532#false} is VALID [2022-04-15 05:42:53,962 INFO L290 TraceCheckUtils]: 41: Hoare triple {12532#false} ~i~0 := 0; {12532#false} is VALID [2022-04-15 05:42:53,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,962 INFO L290 TraceCheckUtils]: 43: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,962 INFO L290 TraceCheckUtils]: 47: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 51: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 52: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 56: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 57: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 58: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 59: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 60: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 61: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 62: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 63: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 64: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 65: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 66: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 67: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,963 INFO L290 TraceCheckUtils]: 68: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 69: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 70: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 71: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 72: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 73: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 74: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 75: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 76: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 77: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 78: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 79: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 80: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 81: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 82: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 83: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 84: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 85: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 86: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,964 INFO L290 TraceCheckUtils]: 87: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,965 INFO L290 TraceCheckUtils]: 88: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,965 INFO L290 TraceCheckUtils]: 89: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,965 INFO L290 TraceCheckUtils]: 90: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:53,965 INFO L290 TraceCheckUtils]: 91: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:53,965 INFO L290 TraceCheckUtils]: 92: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:53,965 INFO L290 TraceCheckUtils]: 93: Hoare triple {12532#false} assume !(~i~0 % 4294967296 < 102400); {12532#false} is VALID [2022-04-15 05:42:53,965 INFO L290 TraceCheckUtils]: 94: Hoare triple {12532#false} assume !false; {12532#false} is VALID [2022-04-15 05:42:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-04-15 05:42:53,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:54,682 INFO L290 TraceCheckUtils]: 94: Hoare triple {12532#false} assume !false; {12532#false} is VALID [2022-04-15 05:42:54,682 INFO L290 TraceCheckUtils]: 93: Hoare triple {12532#false} assume !(~i~0 % 4294967296 < 102400); {12532#false} is VALID [2022-04-15 05:42:54,682 INFO L290 TraceCheckUtils]: 92: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,682 INFO L290 TraceCheckUtils]: 91: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,682 INFO L290 TraceCheckUtils]: 90: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,682 INFO L290 TraceCheckUtils]: 89: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,682 INFO L290 TraceCheckUtils]: 88: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,682 INFO L290 TraceCheckUtils]: 87: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,682 INFO L290 TraceCheckUtils]: 86: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,682 INFO L290 TraceCheckUtils]: 85: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 84: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 83: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 82: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 81: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 80: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 79: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 78: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 77: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 76: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 75: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 74: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 73: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 72: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 71: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 70: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 69: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 68: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 67: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,683 INFO L290 TraceCheckUtils]: 66: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 65: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 64: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 63: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 62: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 61: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 60: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 59: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 58: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 57: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 56: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 55: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 54: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 53: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 52: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 49: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 48: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,684 INFO L290 TraceCheckUtils]: 47: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,685 INFO L290 TraceCheckUtils]: 46: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,685 INFO L290 TraceCheckUtils]: 45: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {12532#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12532#false} is VALID [2022-04-15 05:42:54,685 INFO L290 TraceCheckUtils]: 43: Hoare triple {12532#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12532#false} is VALID [2022-04-15 05:42:54,685 INFO L290 TraceCheckUtils]: 42: Hoare triple {12532#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12532#false} is VALID [2022-04-15 05:42:54,685 INFO L290 TraceCheckUtils]: 41: Hoare triple {12532#false} ~i~0 := 0; {12532#false} is VALID [2022-04-15 05:42:54,685 INFO L290 TraceCheckUtils]: 40: Hoare triple {13003#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {12532#false} is VALID [2022-04-15 05:42:54,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {13007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13003#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 05:42:54,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {13007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {13014#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13007#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {13014#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13014#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,688 INFO L290 TraceCheckUtils]: 35: Hoare triple {13021#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13014#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,688 INFO L290 TraceCheckUtils]: 34: Hoare triple {13021#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13021#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {13028#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13021#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {13028#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13028#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {13035#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13028#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {13035#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13035#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {13042#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13035#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {13042#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13042#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {13049#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13042#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {13049#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13049#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {13056#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13049#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {13056#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13056#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {13063#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13056#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {13063#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13063#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {13070#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13063#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {13070#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13070#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {13077#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13070#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {13077#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13077#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {13084#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13077#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {13084#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13084#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {13091#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13084#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {13091#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13091#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {13098#(< (mod (+ main_~i~0 14) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13091#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {13098#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13098#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {13105#(< (mod (+ main_~i~0 15) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13098#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {13105#(< (mod (+ main_~i~0 15) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13105#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {13112#(< (mod (+ main_~i~0 16) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13105#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {13112#(< (mod (+ main_~i~0 16) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13112#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {13119#(< (mod (+ main_~i~0 17) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13112#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {13119#(< (mod (+ main_~i~0 17) 4294967296) 102400)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13119#(< (mod (+ main_~i~0 17) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {12531#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {13119#(< (mod (+ main_~i~0 17) 4294967296) 102400)} is VALID [2022-04-15 05:42:54,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {12531#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {12531#true} is VALID [2022-04-15 05:42:54,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12531#true} {12531#true} #43#return; {12531#true} is VALID [2022-04-15 05:42:54,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {12531#true} assume true; {12531#true} is VALID [2022-04-15 05:42:54,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {12531#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {12531#true} is VALID [2022-04-15 05:42:54,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {12531#true} call ULTIMATE.init(); {12531#true} is VALID [2022-04-15 05:42:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-04-15 05:42:54,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540078807] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:54,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:54,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-15 05:42:54,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:54,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1181060048] [2022-04-15 05:42:54,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1181060048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:54,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:54,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 05:42:54,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697986219] [2022-04-15 05:42:54,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:54,703 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-15 05:42:54,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:54,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:54,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:54,739 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 05:42:54,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:54,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 05:42:54,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1123, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 05:42:54,740 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:56,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:56,587 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2022-04-15 05:42:56,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 05:42:56,587 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-15 05:42:56,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 113 transitions. [2022-04-15 05:42:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 113 transitions. [2022-04-15 05:42:56,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 113 transitions. [2022-04-15 05:42:56,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:56,680 INFO L225 Difference]: With dead ends: 159 [2022-04-15 05:42:56,680 INFO L226 Difference]: Without dead ends: 104 [2022-04-15 05:42:56,681 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=460, Invalid=1180, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 05:42:56,681 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 64 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:56,681 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 366 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 05:42:56,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-15 05:42:56,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2022-04-15 05:42:56,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:56,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:56,769 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:56,769 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:56,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:56,770 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-04-15 05:42:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-04-15 05:42:56,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:56,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:56,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 104 states. [2022-04-15 05:42:56,771 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 104 states. [2022-04-15 05:42:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:56,772 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-04-15 05:42:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-04-15 05:42:56,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:56,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:56,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:56,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:56,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2022-04-15 05:42:56,773 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 95 [2022-04-15 05:42:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:56,773 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2022-04-15 05:42:56,773 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:56,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 102 transitions. [2022-04-15 05:42:56,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-04-15 05:42:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-15 05:42:56,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:56,846 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:56,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:57,046 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:57,046 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:57,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:57,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1469568340, now seen corresponding path program 35 times [2022-04-15 05:42:57,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:57,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1742349229] [2022-04-15 05:42:57,056 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:57,056 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:57,056 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:57,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1469568340, now seen corresponding path program 36 times [2022-04-15 05:42:57,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:57,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067890888] [2022-04-15 05:42:57,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:57,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:57,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:57,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {13897#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {13873#true} is VALID [2022-04-15 05:42:57,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {13873#true} assume true; {13873#true} is VALID [2022-04-15 05:42:57,423 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13873#true} {13873#true} #43#return; {13873#true} is VALID [2022-04-15 05:42:57,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {13873#true} call ULTIMATE.init(); {13897#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:57,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {13897#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {13873#true} is VALID [2022-04-15 05:42:57,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {13873#true} assume true; {13873#true} is VALID [2022-04-15 05:42:57,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13873#true} {13873#true} #43#return; {13873#true} is VALID [2022-04-15 05:42:57,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {13873#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {13873#true} is VALID [2022-04-15 05:42:57,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {13873#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {13878#(= main_~i~0 0)} is VALID [2022-04-15 05:42:57,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {13878#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13878#(= main_~i~0 0)} is VALID [2022-04-15 05:42:57,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {13878#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13879#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:57,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {13879#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13879#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 05:42:57,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {13879#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13880#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:57,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {13880#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13880#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 05:42:57,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {13880#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13881#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:57,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {13881#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13881#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 05:42:57,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {13881#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13882#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:57,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {13882#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13882#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:57,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {13882#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13883#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:57,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {13883#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13883#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 05:42:57,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {13883#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13884#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:57,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {13884#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13884#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 05:42:57,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {13884#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13885#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:57,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {13885#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13885#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 05:42:57,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {13885#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13886#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:57,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {13886#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13886#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 05:42:57,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {13886#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13887#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:57,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {13887#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13887#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 05:42:57,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {13887#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13888#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:57,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {13888#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13888#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 05:42:57,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {13888#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13889#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:57,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {13889#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13889#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 05:42:57,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {13889#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13890#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:57,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {13890#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13890#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 05:42:57,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {13890#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13891#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:57,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {13891#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13891#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 05:42:57,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {13891#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13892#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 05:42:57,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {13892#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13892#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 05:42:57,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {13892#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13893#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 05:42:57,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {13893#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13893#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 05:42:57,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {13893#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13894#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 05:42:57,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {13894#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13894#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 05:42:57,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {13894#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13895#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 05:42:57,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {13895#(and (<= 17 main_~i~0) (<= main_~i~0 17))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {13895#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 05:42:57,439 INFO L290 TraceCheckUtils]: 41: Hoare triple {13895#(and (<= 17 main_~i~0) (<= main_~i~0 17))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13896#(and (<= main_~i~0 18) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:42:57,439 INFO L290 TraceCheckUtils]: 42: Hoare triple {13896#(and (<= main_~i~0 18) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {13874#false} is VALID [2022-04-15 05:42:57,439 INFO L290 TraceCheckUtils]: 43: Hoare triple {13874#false} ~i~0 := 0; {13874#false} is VALID [2022-04-15 05:42:57,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 47: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 48: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 49: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 50: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 51: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 52: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 53: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 54: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 55: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 56: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 57: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 58: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 59: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 60: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 61: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 62: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 63: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 64: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,440 INFO L290 TraceCheckUtils]: 65: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 66: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 67: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 68: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 69: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 70: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 71: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 72: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 73: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 74: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 75: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 76: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 77: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 78: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 79: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 80: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 81: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 82: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,441 INFO L290 TraceCheckUtils]: 83: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,442 INFO L290 TraceCheckUtils]: 84: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,442 INFO L290 TraceCheckUtils]: 85: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,442 INFO L290 TraceCheckUtils]: 86: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,442 INFO L290 TraceCheckUtils]: 87: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,442 INFO L290 TraceCheckUtils]: 88: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,442 INFO L290 TraceCheckUtils]: 89: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,442 INFO L290 TraceCheckUtils]: 90: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,442 INFO L290 TraceCheckUtils]: 91: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,442 INFO L290 TraceCheckUtils]: 92: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,442 INFO L290 TraceCheckUtils]: 93: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,442 INFO L290 TraceCheckUtils]: 94: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,442 INFO L290 TraceCheckUtils]: 95: Hoare triple {13874#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13874#false} is VALID [2022-04-15 05:42:57,442 INFO L290 TraceCheckUtils]: 96: Hoare triple {13874#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13874#false} is VALID [2022-04-15 05:42:57,442 INFO L290 TraceCheckUtils]: 97: Hoare triple {13874#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13874#false} is VALID [2022-04-15 05:42:57,442 INFO L290 TraceCheckUtils]: 98: Hoare triple {13874#false} assume !(~i~0 % 4294967296 < 102400); {13874#false} is VALID [2022-04-15 05:42:57,442 INFO L290 TraceCheckUtils]: 99: Hoare triple {13874#false} assume !false; {13874#false} is VALID [2022-04-15 05:42:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2022-04-15 05:42:57,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:57,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067890888] [2022-04-15 05:42:57,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067890888] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:57,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972149888] [2022-04-15 05:42:57,443 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:42:57,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:57,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:57,444 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:57,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process