/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/compact.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:16:49,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:16:49,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:16:49,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:16:49,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:16:49,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:16:49,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:16:49,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:16:49,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:16:49,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:16:49,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:16:49,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:16:49,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:16:49,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:16:49,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:16:49,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:16:49,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:16:49,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:16:49,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:16:49,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:16:49,594 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:16:49,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:16:49,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:16:49,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:16:49,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:16:49,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:16:49,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:16:49,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:16:49,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:16:49,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:16:49,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:16:49,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:16:49,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:16:49,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:16:49,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:16:49,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:16:49,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:16:49,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:16:49,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:16:49,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:16:49,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:16:49,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:16:49,608 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:16:49,633 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:16:49,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:16:49,634 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:16:49,634 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:16:49,635 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:16:49,635 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:16:49,635 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:16:49,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:16:49,636 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:16:49,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:16:49,636 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:16:49,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:16:49,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:16:49,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:16:49,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:16:49,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:16:49,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:16:49,638 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:16:49,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:16:49,638 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:16:49,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:16:49,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:16:49,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:16:49,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:16:49,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:49,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:16:49,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:16:49,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:16:49,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:16:49,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:16:49,639 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:16:49,640 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:16:49,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:16:49,640 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 10:16:49,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:16:49,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:16:49,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:16:49,843 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:16:49,847 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:16:49,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/compact.c [2022-04-27 10:16:49,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/febab55eb/ff5fe8f5f1a14172b435451b898616e0/FLAGb9e50e61c [2022-04-27 10:16:50,188 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:16:50,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/compact.c [2022-04-27 10:16:50,195 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/febab55eb/ff5fe8f5f1a14172b435451b898616e0/FLAGb9e50e61c [2022-04-27 10:16:50,626 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/febab55eb/ff5fe8f5f1a14172b435451b898616e0 [2022-04-27 10:16:50,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:16:50,629 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:16:50,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:50,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:16:50,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:16:50,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1319aed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50, skipping insertion in model container [2022-04-27 10:16:50,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:16:50,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:16:50,798 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-27 10:16:50,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:50,809 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:16:50,821 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-27 10:16:50,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:50,838 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:16:50,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50 WrapperNode [2022-04-27 10:16:50,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:50,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:16:50,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:16:50,840 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:16:50,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:16:50,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:16:50,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:16:50,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:16:50,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:50,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:50,906 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-27 10:16:50,915 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-27 10:16:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:16:50,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:16:50,950 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:16:50,951 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:16:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:16:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:16:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:16:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:16:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 10:16:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:16:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:16:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:16:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:16:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:16:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:16:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:16:51,050 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:16:51,051 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:16:51,199 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:16:51,208 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:16:51,208 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 10:16:51,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:51 BoogieIcfgContainer [2022-04-27 10:16:51,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:16:51,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:16:51,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:16:51,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:16:51,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:16:50" (1/3) ... [2022-04-27 10:16:51,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392735b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:51, skipping insertion in model container [2022-04-27 10:16:51,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (2/3) ... [2022-04-27 10:16:51,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392735b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:51, skipping insertion in model container [2022-04-27 10:16:51,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:51" (3/3) ... [2022-04-27 10:16:51,216 INFO L111 eAbstractionObserver]: Analyzing ICFG compact.c [2022-04-27 10:16:51,229 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:16:51,229 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:16:51,274 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:16:51,280 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@547d083e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50f590d4 [2022-04-27 10:16:51,280 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:16:51,285 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-27 10:16:51,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-27 10:16:51,289 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:51,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:51,290 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:51,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:51,294 INFO L85 PathProgramCache]: Analyzing trace with hash 927625408, now seen corresponding path program 1 times [2022-04-27 10:16:51,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:51,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276872269] [2022-04-27 10:16:51,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:51,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:51,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:51,473 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-27 10:16:51,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 10:16:51,474 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #43#return; {21#true} is VALID [2022-04-27 10:16:51,477 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-27 10:16:51,477 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-27 10:16:51,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 10:16:51,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #43#return; {21#true} is VALID [2022-04-27 10:16:51,478 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-27 10:16:51,478 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-27 10:16:51,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-27 10:16:51,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} ~i~0 := 0; {22#false} is VALID [2022-04-27 10:16:51,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume !true; {22#false} is VALID [2022-04-27 10:16:51,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-27 10:16:51,480 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-27 10:16:51,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:51,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276872269] [2022-04-27 10:16:51,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276872269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:51,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:51,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:16:51,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115887774] [2022-04-27 10:16:51,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:51,487 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-27 10:16:51,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:51,490 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-27 10:16:51,502 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-27 10:16:51,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:16:51,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:51,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:16:51,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:16:51,520 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-27 10:16:51,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:51,637 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-04-27 10:16:51,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:16:51,637 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-27 10:16:51,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:51,639 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-27 10:16:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-27 10:16:51,646 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-27 10:16:51,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-27 10:16:51,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-27 10:16:51,693 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-27 10:16:51,699 INFO L225 Difference]: With dead ends: 37 [2022-04-27 10:16:51,699 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 10:16:51,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:16:51,702 INFO L413 NwaCegarLoop]: 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-27 10:16:51,703 INFO L414 NwaCegarLoop]: 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-27 10:16:51,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 10:16:51,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2022-04-27 10:16:51,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:51,724 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-27 10:16:51,725 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-27 10:16:51,725 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-27 10:16:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:51,728 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-27 10:16:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-27 10:16:51,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:51,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:51,729 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-27 10:16:51,729 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-27 10:16:51,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:51,731 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-27 10:16:51,731 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-27 10:16:51,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:51,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:51,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:51,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:51,732 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-27 10:16:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 10:16:51,734 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2022-04-27 10:16:51,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:51,734 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 10:16:51,734 INFO L496 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-27 10:16:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 10:16:51,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-27 10:16:51,735 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:51,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:51,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:16:51,736 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:51,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:51,736 INFO L85 PathProgramCache]: Analyzing trace with hash 927446352, now seen corresponding path program 1 times [2022-04-27 10:16:51,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:51,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398798632] [2022-04-27 10:16:51,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:51,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:51,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:51,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {143#(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); {137#true} is VALID [2022-04-27 10:16:51,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {137#true} assume true; {137#true} is VALID [2022-04-27 10:16:51,792 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {137#true} {137#true} #43#return; {137#true} is VALID [2022-04-27 10:16:51,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {137#true} call ULTIMATE.init(); {143#(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-27 10:16:51,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#(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); {137#true} is VALID [2022-04-27 10:16:51,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {137#true} assume true; {137#true} is VALID [2022-04-27 10:16:51,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137#true} {137#true} #43#return; {137#true} is VALID [2022-04-27 10:16:51,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {137#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {137#true} is VALID [2022-04-27 10:16:51,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {137#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; {142#(= main_~i~0 0)} is VALID [2022-04-27 10:16:51,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {142#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < 102400); {138#false} is VALID [2022-04-27 10:16:51,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {138#false} ~i~0 := 0; {138#false} is VALID [2022-04-27 10:16:51,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {138#false} assume !(~i~0 % 4294967296 < 102400); {138#false} is VALID [2022-04-27 10:16:51,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {138#false} assume !false; {138#false} is VALID [2022-04-27 10:16:51,795 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-27 10:16:51,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:51,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398798632] [2022-04-27 10:16:51,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398798632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:51,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:51,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:16:51,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711380247] [2022-04-27 10:16:51,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:51,797 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-27 10:16:51,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:51,798 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-27 10:16:51,805 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-27 10:16:51,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:16:51,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:51,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:16:51,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:16:51,806 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-27 10:16:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:51,871 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 10:16:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:16:51,871 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-27 10:16:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:51,872 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-27 10:16:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-27 10:16:51,873 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-27 10:16:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-27 10:16:51,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-27 10:16:51,896 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-27 10:16:51,897 INFO L225 Difference]: With dead ends: 25 [2022-04-27 10:16:51,897 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 10:16:51,898 INFO L412 NwaCegarLoop]: 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-27 10:16:51,898 INFO L413 NwaCegarLoop]: 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-27 10:16:51,899 INFO L414 NwaCegarLoop]: 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-27 10:16:51,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 10:16:51,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2022-04-27 10:16:51,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:51,901 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-27 10:16:51,901 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-27 10:16:51,901 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-27 10:16:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:51,902 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-27 10:16:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-27 10:16:51,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:51,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:51,903 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-27 10:16:51,903 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-27 10:16:51,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:51,904 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-27 10:16:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-27 10:16:51,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:51,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:51,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:51,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:51,904 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-27 10:16:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-27 10:16:51,905 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 10 [2022-04-27 10:16:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:51,905 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-27 10:16:51,905 INFO L496 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-27 10:16:51,905 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 10:16:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:16:51,906 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:51,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:51,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:16:51,906 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:51,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash 706936613, now seen corresponding path program 1 times [2022-04-27 10:16:51,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:51,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795372118] [2022-04-27 10:16:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#(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); {244#true} is VALID [2022-04-27 10:16:52,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} assume true; {244#true} is VALID [2022-04-27 10:16:52,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {244#true} {244#true} #43#return; {244#true} is VALID [2022-04-27 10:16:52,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {244#true} call ULTIMATE.init(); {251#(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-27 10:16:52,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#(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); {244#true} is VALID [2022-04-27 10:16:52,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} assume true; {244#true} is VALID [2022-04-27 10:16:52,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {244#true} {244#true} #43#return; {244#true} is VALID [2022-04-27 10:16:52,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {244#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {244#true} is VALID [2022-04-27 10:16:52,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#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; {249#(= main_~i~0 0)} is VALID [2022-04-27 10:16:52,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {249#(= 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; {249#(= main_~i~0 0)} is VALID [2022-04-27 10:16:52,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {249#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {250#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:16:52,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {245#false} is VALID [2022-04-27 10:16:52,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {245#false} ~i~0 := 0; {245#false} is VALID [2022-04-27 10:16:52,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {245#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {245#false} is VALID [2022-04-27 10:16:52,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {245#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {245#false} is VALID [2022-04-27 10:16:52,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {245#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {245#false} is VALID [2022-04-27 10:16:52,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {245#false} assume !(~i~0 % 4294967296 < 102400); {245#false} is VALID [2022-04-27 10:16:52,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {245#false} assume !false; {245#false} is VALID [2022-04-27 10:16:52,049 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-27 10:16:52,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:52,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795372118] [2022-04-27 10:16:52,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795372118] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:52,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133630979] [2022-04-27 10:16:52,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:52,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:52,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:52,052 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-27 10:16:52,054 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-27 10:16:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 10:16:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:52,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {244#true} call ULTIMATE.init(); {244#true} is VALID [2022-04-27 10:16:52,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#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); {244#true} is VALID [2022-04-27 10:16:52,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} assume true; {244#true} is VALID [2022-04-27 10:16:52,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {244#true} {244#true} #43#return; {244#true} is VALID [2022-04-27 10:16:52,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {244#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {244#true} is VALID [2022-04-27 10:16:52,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#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; {249#(= main_~i~0 0)} is VALID [2022-04-27 10:16:52,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {249#(= 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; {249#(= main_~i~0 0)} is VALID [2022-04-27 10:16:52,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {249#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {276#(= main_~i~0 1)} is VALID [2022-04-27 10:16:52,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#(= main_~i~0 1)} assume !(~i~0 % 4294967296 < 102400); {245#false} is VALID [2022-04-27 10:16:52,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {245#false} ~i~0 := 0; {245#false} is VALID [2022-04-27 10:16:52,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {245#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {245#false} is VALID [2022-04-27 10:16:52,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {245#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {245#false} is VALID [2022-04-27 10:16:52,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {245#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {245#false} is VALID [2022-04-27 10:16:52,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {245#false} assume !(~i~0 % 4294967296 < 102400); {245#false} is VALID [2022-04-27 10:16:52,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {245#false} assume !false; {245#false} is VALID [2022-04-27 10:16:52,183 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-27 10:16:52,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:16:52,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {245#false} assume !false; {245#false} is VALID [2022-04-27 10:16:52,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {245#false} assume !(~i~0 % 4294967296 < 102400); {245#false} is VALID [2022-04-27 10:16:52,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {245#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {245#false} is VALID [2022-04-27 10:16:52,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {245#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {245#false} is VALID [2022-04-27 10:16:52,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {245#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {245#false} is VALID [2022-04-27 10:16:52,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {245#false} ~i~0 := 0; {245#false} is VALID [2022-04-27 10:16:52,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {316#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {245#false} is VALID [2022-04-27 10:16:52,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {320#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {316#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-27 10:16:52,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {320#(< (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; {320#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-27 10:16:52,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#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; {320#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-27 10:16:52,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {244#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {244#true} is VALID [2022-04-27 10:16:52,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {244#true} {244#true} #43#return; {244#true} is VALID [2022-04-27 10:16:52,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} assume true; {244#true} is VALID [2022-04-27 10:16:52,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#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); {244#true} is VALID [2022-04-27 10:16:52,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {244#true} call ULTIMATE.init(); {244#true} is VALID [2022-04-27 10:16:52,282 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-27 10:16:52,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133630979] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:16:52,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:16:52,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 10:16:52,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232949503] [2022-04-27 10:16:52,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:16:52,285 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:16:52,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:52,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,308 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-27 10:16:52,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:16:52,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:52,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:16:52,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:16:52,310 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,510 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-27 10:16:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:16:52,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:16:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-27 10:16:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-27 10:16:52,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-27 10:16:52,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:52,568 INFO L225 Difference]: With dead ends: 38 [2022-04-27 10:16:52,569 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 10:16:52,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:16:52,570 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:52,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 27 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:16:52,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 10:16:52,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 10:16:52,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:52,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 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-27 10:16:52,577 INFO L74 IsIncluded]: Start isIncluded. First operand 31 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-27 10:16:52,577 INFO L87 Difference]: Start difference. First operand 31 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-27 10:16:52,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,579 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-04-27 10:16:52,579 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-27 10:16:52,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,579 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 31 states. [2022-04-27 10:16:52,580 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 31 states. [2022-04-27 10:16:52,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,581 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-04-27 10:16:52,581 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-27 10:16:52,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:52,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:52,582 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-27 10:16:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-27 10:16:52,583 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 15 [2022-04-27 10:16:52,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:52,583 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-27 10:16:52,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-27 10:16:52,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 10:16:52,584 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:52,584 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:52,614 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-27 10:16:52,805 WARN L477 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-27 10:16:52,806 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:52,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:52,806 INFO L85 PathProgramCache]: Analyzing trace with hash 329033496, now seen corresponding path program 2 times [2022-04-27 10:16:52,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:52,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687834326] [2022-04-27 10:16:52,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:52,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {519#(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); {509#true} is VALID [2022-04-27 10:16:52,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {509#true} assume true; {509#true} is VALID [2022-04-27 10:16:52,935 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {509#true} {509#true} #43#return; {509#true} is VALID [2022-04-27 10:16:52,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {509#true} call ULTIMATE.init(); {519#(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-27 10:16:52,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {519#(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); {509#true} is VALID [2022-04-27 10:16:52,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {509#true} assume true; {509#true} is VALID [2022-04-27 10:16:52,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {509#true} {509#true} #43#return; {509#true} is VALID [2022-04-27 10:16:52,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {509#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {509#true} is VALID [2022-04-27 10:16:52,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#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; {514#(= main_~i~0 0)} is VALID [2022-04-27 10:16:52,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {514#(= 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; {514#(= main_~i~0 0)} is VALID [2022-04-27 10:16:52,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {515#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:16:52,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {515#(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; {515#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:16:52,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {515#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {516#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:16:52,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {516#(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; {516#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:16:52,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {516#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {517#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:52,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {517#(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; {517#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:52,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {517#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {518#(and (<= main_~i~0 4) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:16:52,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {518#(and (<= main_~i~0 4) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {510#false} is VALID [2022-04-27 10:16:52,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {510#false} ~i~0 := 0; {510#false} is VALID [2022-04-27 10:16:52,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {510#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {510#false} is VALID [2022-04-27 10:16:52,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {510#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {510#false} is VALID [2022-04-27 10:16:52,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {510#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {510#false} is VALID [2022-04-27 10:16:52,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {510#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {510#false} is VALID [2022-04-27 10:16:52,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {510#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {510#false} is VALID [2022-04-27 10:16:52,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {510#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {510#false} is VALID [2022-04-27 10:16:52,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {510#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {510#false} is VALID [2022-04-27 10:16:52,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {510#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {510#false} is VALID [2022-04-27 10:16:52,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {510#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {510#false} is VALID [2022-04-27 10:16:52,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {510#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {510#false} is VALID [2022-04-27 10:16:52,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {510#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {510#false} is VALID [2022-04-27 10:16:52,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {510#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {510#false} is VALID [2022-04-27 10:16:52,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {510#false} assume !(~i~0 % 4294967296 < 102400); {510#false} is VALID [2022-04-27 10:16:52,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {510#false} assume !false; {510#false} is VALID [2022-04-27 10:16:52,944 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-27 10:16:52,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:52,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687834326] [2022-04-27 10:16:52,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687834326] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:52,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594639758] [2022-04-27 10:16:52,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:16:52,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:52,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:52,950 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-27 10:16:52,951 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-27 10:16:53,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:16:53,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:16:53,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 10:16:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:53,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:53,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {509#true} call ULTIMATE.init(); {509#true} is VALID [2022-04-27 10:16:53,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {509#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); {509#true} is VALID [2022-04-27 10:16:53,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {509#true} assume true; {509#true} is VALID [2022-04-27 10:16:53,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {509#true} {509#true} #43#return; {509#true} is VALID [2022-04-27 10:16:53,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {509#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {509#true} is VALID [2022-04-27 10:16:53,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#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; {514#(= main_~i~0 0)} is VALID [2022-04-27 10:16:53,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {514#(= 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; {514#(= main_~i~0 0)} is VALID [2022-04-27 10:16:53,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {515#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:16:53,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {515#(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; {515#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:16:53,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {515#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {516#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:16:53,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {516#(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; {516#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:16:53,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {516#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {517#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:53,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {517#(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; {517#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:53,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {517#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {509#true} is VALID [2022-04-27 10:16:53,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {509#true} assume !(~i~0 % 4294967296 < 102400); {509#true} is VALID [2022-04-27 10:16:53,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {509#true} ~i~0 := 0; {514#(= main_~i~0 0)} is VALID [2022-04-27 10:16:53,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {514#(= 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); {514#(= main_~i~0 0)} is VALID [2022-04-27 10:16:53,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {514#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {514#(= main_~i~0 0)} is VALID [2022-04-27 10:16:53,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {514#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {515#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:16:53,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {515#(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); {515#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:16:53,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {515#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {515#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:16:53,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {515#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {516#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:16:53,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {516#(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); {516#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:16:53,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {516#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {516#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:16:53,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {516#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {517#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:53,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {517#(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); {517#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:53,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {517#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {517#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:53,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {517#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {604#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:16:53,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {604#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {510#false} is VALID [2022-04-27 10:16:53,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {510#false} assume !false; {510#false} is VALID [2022-04-27 10:16:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:53,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:16:53,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {510#false} assume !false; {510#false} is VALID [2022-04-27 10:16:53,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {614#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {510#false} is VALID [2022-04-27 10:16:53,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {618#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {614#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-27 10:16:53,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {618#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {618#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-27 10:16:53,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {618#(< (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); {618#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-27 10:16:53,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {628#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {618#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-27 10:16:53,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {628#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {628#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-27 10:16:53,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {628#(< (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); {628#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-27 10:16:53,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {638#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {628#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-27 10:16:53,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {638#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {638#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-27 10:16:53,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {638#(< (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); {638#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-27 10:16:53,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {648#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {638#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-27 10:16:53,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {648#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {648#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-27 10:16:53,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {648#(< (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); {648#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-27 10:16:53,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {509#true} ~i~0 := 0; {648#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-27 10:16:53,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {509#true} assume !(~i~0 % 4294967296 < 102400); {509#true} is VALID [2022-04-27 10:16:53,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {509#true} is VALID [2022-04-27 10:16:53,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {509#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; {509#true} is VALID [2022-04-27 10:16:53,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {509#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {509#true} is VALID [2022-04-27 10:16:53,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {509#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; {509#true} is VALID [2022-04-27 10:16:53,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {509#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {509#true} is VALID [2022-04-27 10:16:53,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {509#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; {509#true} is VALID [2022-04-27 10:16:53,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {509#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {509#true} is VALID [2022-04-27 10:16:53,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {509#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; {509#true} is VALID [2022-04-27 10:16:53,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#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; {509#true} is VALID [2022-04-27 10:16:53,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {509#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {509#true} is VALID [2022-04-27 10:16:53,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {509#true} {509#true} #43#return; {509#true} is VALID [2022-04-27 10:16:53,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {509#true} assume true; {509#true} is VALID [2022-04-27 10:16:53,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {509#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); {509#true} is VALID [2022-04-27 10:16:53,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {509#true} call ULTIMATE.init(); {509#true} is VALID [2022-04-27 10:16:53,555 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-27 10:16:53,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594639758] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:16:53,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:16:53,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 10:16:53,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580273996] [2022-04-27 10:16:53,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:16:53,556 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 10:16:53,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:53,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:53,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:53,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:16:53,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:53,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:16:53,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:16:53,602 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:54,286 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-27 10:16:54,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 10:16:54,286 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 10:16:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2022-04-27 10:16:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2022-04-27 10:16:54,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 80 transitions. [2022-04-27 10:16:54,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:54,362 INFO L225 Difference]: With dead ends: 77 [2022-04-27 10:16:54,362 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 10:16:54,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2022-04-27 10:16:54,363 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 69 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:54,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 66 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:16:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 10:16:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-27 10:16:54,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:54,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 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-27 10:16:54,387 INFO L74 IsIncluded]: Start isIncluded. First operand 61 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-27 10:16:54,387 INFO L87 Difference]: Start difference. First operand 61 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-27 10:16:54,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:54,389 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-27 10:16:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-27 10:16:54,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:54,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:54,389 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 61 states. [2022-04-27 10:16:54,390 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 61 states. [2022-04-27 10:16:54,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:54,391 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-27 10:16:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-27 10:16:54,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:54,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:54,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:54,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:54,392 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-27 10:16:54,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-04-27 10:16:54,394 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 30 [2022-04-27 10:16:54,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:54,394 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-04-27 10:16:54,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-27 10:16:54,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-27 10:16:54,395 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:54,395 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:54,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:16:54,605 WARN L477 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-27 10:16:54,605 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:54,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:54,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1999539772, now seen corresponding path program 3 times [2022-04-27 10:16:54,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:54,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55128677] [2022-04-27 10:16:54,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:54,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:54,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:54,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {1052#(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); {1036#true} is VALID [2022-04-27 10:16:54,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {1036#true} assume true; {1036#true} is VALID [2022-04-27 10:16:54,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1036#true} {1036#true} #43#return; {1036#true} is VALID [2022-04-27 10:16:54,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {1036#true} call ULTIMATE.init(); {1052#(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-27 10:16:54,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {1052#(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); {1036#true} is VALID [2022-04-27 10:16:54,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {1036#true} assume true; {1036#true} is VALID [2022-04-27 10:16:54,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1036#true} {1036#true} #43#return; {1036#true} is VALID [2022-04-27 10:16:54,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {1036#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1036#true} is VALID [2022-04-27 10:16:54,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {1036#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; {1041#(= main_~i~0 0)} is VALID [2022-04-27 10:16:54,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {1041#(= 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; {1041#(= main_~i~0 0)} is VALID [2022-04-27 10:16:54,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {1041#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1042#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:16:54,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#(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; {1042#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:16:54,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1043#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:16:54,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {1043#(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; {1043#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:16:54,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {1043#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1044#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:54,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {1044#(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; {1044#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:54,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {1044#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1045#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:16:54,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {1045#(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; {1045#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:16:54,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {1045#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1046#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 10:16:54,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {1046#(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; {1046#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 10:16:54,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {1046#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1047#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 10:16:54,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {1047#(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; {1047#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 10:16:54,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {1047#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1048#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 10:16:54,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {1048#(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; {1048#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 10:16:54,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1049#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-27 10:16:54,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {1049#(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; {1049#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-27 10:16:54,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {1049#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1050#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-27 10:16:54,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {1050#(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; {1050#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-27 10:16:54,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {1050#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1051#(and (<= main_~i~0 10) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:16:54,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {1051#(and (<= main_~i~0 10) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 102400); {1037#false} is VALID [2022-04-27 10:16:54,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {1037#false} ~i~0 := 0; {1037#false} is VALID [2022-04-27 10:16:54,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:54,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:54,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:54,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:54,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:54,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:54,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:54,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:54,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:54,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:54,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:54,935 INFO L290 TraceCheckUtils]: 39: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:54,935 INFO L290 TraceCheckUtils]: 40: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:54,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:54,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:54,935 INFO L290 TraceCheckUtils]: 43: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:54,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:54,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:54,935 INFO L290 TraceCheckUtils]: 46: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:54,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:54,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:54,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:54,936 INFO L290 TraceCheckUtils]: 50: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:54,936 INFO L290 TraceCheckUtils]: 51: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:54,936 INFO L290 TraceCheckUtils]: 52: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:54,936 INFO L290 TraceCheckUtils]: 53: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:54,936 INFO L290 TraceCheckUtils]: 54: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:54,936 INFO L290 TraceCheckUtils]: 55: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:54,936 INFO L290 TraceCheckUtils]: 56: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:54,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:54,936 INFO L290 TraceCheckUtils]: 58: Hoare triple {1037#false} assume !(~i~0 % 4294967296 < 102400); {1037#false} is VALID [2022-04-27 10:16:54,937 INFO L290 TraceCheckUtils]: 59: Hoare triple {1037#false} assume !false; {1037#false} is VALID [2022-04-27 10:16:54,937 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-27 10:16:54,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:54,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55128677] [2022-04-27 10:16:54,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55128677] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:54,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207991520] [2022-04-27 10:16:54,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:16:54,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:54,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:54,938 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-27 10:16:54,940 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-27 10:16:56,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 10:16:56,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:16:56,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 10:16:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:56,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {1036#true} call ULTIMATE.init(); {1036#true} is VALID [2022-04-27 10:16:56,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {1036#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); {1036#true} is VALID [2022-04-27 10:16:56,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {1036#true} assume true; {1036#true} is VALID [2022-04-27 10:16:56,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1036#true} {1036#true} #43#return; {1036#true} is VALID [2022-04-27 10:16:56,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {1036#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1036#true} is VALID [2022-04-27 10:16:56,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {1036#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; {1041#(= main_~i~0 0)} is VALID [2022-04-27 10:16:56,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {1041#(= 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; {1041#(= main_~i~0 0)} is VALID [2022-04-27 10:16:56,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {1041#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1042#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:16:56,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#(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; {1042#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:16:56,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1043#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:16:56,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {1043#(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; {1043#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:16:56,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {1043#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1044#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:56,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {1044#(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; {1044#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:56,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {1044#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1045#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:16:56,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {1045#(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; {1045#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:16:56,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {1045#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1046#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 10:16:56,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {1046#(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; {1046#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 10:16:56,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {1046#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1047#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 10:16:56,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {1047#(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; {1047#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 10:16:56,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {1047#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1048#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 10:16:56,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {1048#(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; {1048#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 10:16:56,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1049#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-27 10:16:56,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {1049#(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; {1049#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-27 10:16:56,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {1049#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1050#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-27 10:16:56,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {1050#(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; {1050#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-27 10:16:56,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {1050#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1131#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-27 10:16:56,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {1131#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !(~i~0 % 4294967296 < 102400); {1037#false} is VALID [2022-04-27 10:16:56,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {1037#false} ~i~0 := 0; {1037#false} is VALID [2022-04-27 10:16:56,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,602 INFO L290 TraceCheckUtils]: 40: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,602 INFO L290 TraceCheckUtils]: 48: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,602 INFO L290 TraceCheckUtils]: 50: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,603 INFO L290 TraceCheckUtils]: 57: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,603 INFO L290 TraceCheckUtils]: 58: Hoare triple {1037#false} assume !(~i~0 % 4294967296 < 102400); {1037#false} is VALID [2022-04-27 10:16:56,603 INFO L290 TraceCheckUtils]: 59: Hoare triple {1037#false} assume !false; {1037#false} is VALID [2022-04-27 10:16:56,603 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-27 10:16:56,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:16:56,980 INFO L290 TraceCheckUtils]: 59: Hoare triple {1037#false} assume !false; {1037#false} is VALID [2022-04-27 10:16:56,980 INFO L290 TraceCheckUtils]: 58: Hoare triple {1037#false} assume !(~i~0 % 4294967296 < 102400); {1037#false} is VALID [2022-04-27 10:16:56,980 INFO L290 TraceCheckUtils]: 57: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,980 INFO L290 TraceCheckUtils]: 56: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,981 INFO L290 TraceCheckUtils]: 55: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,981 INFO L290 TraceCheckUtils]: 54: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,981 INFO L290 TraceCheckUtils]: 53: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,981 INFO L290 TraceCheckUtils]: 52: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,981 INFO L290 TraceCheckUtils]: 51: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,981 INFO L290 TraceCheckUtils]: 50: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,982 INFO L290 TraceCheckUtils]: 49: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,982 INFO L290 TraceCheckUtils]: 47: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,982 INFO L290 TraceCheckUtils]: 46: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,982 INFO L290 TraceCheckUtils]: 45: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,982 INFO L290 TraceCheckUtils]: 44: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,982 INFO L290 TraceCheckUtils]: 43: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,982 INFO L290 TraceCheckUtils]: 42: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,983 INFO L290 TraceCheckUtils]: 41: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2022-04-27 10:16:56,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {1037#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1037#false} is VALID [2022-04-27 10:16:56,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {1037#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1037#false} is VALID [2022-04-27 10:16:56,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {1037#false} ~i~0 := 0; {1037#false} is VALID [2022-04-27 10:16:56,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {1333#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {1037#false} is VALID [2022-04-27 10:16:56,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {1337#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1333#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-27 10:16:56,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {1337#(< (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; {1337#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {1344#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1337#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {1344#(< (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; {1344#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {1351#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1344#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {1351#(< (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; {1351#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {1358#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1351#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {1358#(< (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; {1358#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {1365#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1358#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {1365#(< (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; {1365#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {1372#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1365#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {1372#(< (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; {1372#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {1379#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1372#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {1379#(< (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; {1379#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {1386#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1379#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {1386#(< (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; {1386#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {1393#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1386#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {1393#(< (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; {1393#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {1400#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1393#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {1400#(< (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; {1400#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {1036#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; {1400#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-27 10:16:56,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {1036#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1036#true} is VALID [2022-04-27 10:16:57,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1036#true} {1036#true} #43#return; {1036#true} is VALID [2022-04-27 10:16:57,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {1036#true} assume true; {1036#true} is VALID [2022-04-27 10:16:57,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {1036#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); {1036#true} is VALID [2022-04-27 10:16:57,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {1036#true} call ULTIMATE.init(); {1036#true} is VALID [2022-04-27 10:16:57,000 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-27 10:16:57,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207991520] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:16:57,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:16:57,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-27 10:16:57,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999054100] [2022-04-27 10:16:57,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:16:57,003 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-27 10:16:57,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:57,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:57,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:57,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 10:16:57,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:57,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 10:16:57,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-27 10:16:57,048 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:02,615 INFO L93 Difference]: Finished difference Result 155 states and 180 transitions. [2022-04-27 10:17:02,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-27 10:17:02,615 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-27 10:17:02,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 152 transitions. [2022-04-27 10:17:02,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 152 transitions. [2022-04-27 10:17:02,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 152 transitions. [2022-04-27 10:17:02,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:02,861 INFO L225 Difference]: With dead ends: 155 [2022-04-27 10:17:02,861 INFO L226 Difference]: Without dead ends: 121 [2022-04-27 10:17:02,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=468, Invalid=864, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 10:17:02,863 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 263 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:02,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 198 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 10:17:02,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-27 10:17:02,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-04-27 10:17:02,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:02,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 121 states, 117 states have (on average 1.017094017094017) internal successors, (119), 117 states have internal predecessors, (119), 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-27 10:17:02,924 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 121 states, 117 states have (on average 1.017094017094017) internal successors, (119), 117 states have internal predecessors, (119), 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-27 10:17:02,924 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 121 states, 117 states have (on average 1.017094017094017) internal successors, (119), 117 states have internal predecessors, (119), 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-27 10:17:02,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:02,937 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-04-27 10:17:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2022-04-27 10:17:02,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:02,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:02,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 117 states have (on average 1.017094017094017) internal successors, (119), 117 states have internal predecessors, (119), 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 121 states. [2022-04-27 10:17:02,944 INFO L87 Difference]: Start difference. First operand has 121 states, 117 states have (on average 1.017094017094017) internal successors, (119), 117 states have internal predecessors, (119), 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 121 states. [2022-04-27 10:17:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:02,949 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-04-27 10:17:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2022-04-27 10:17:02,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:02,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:02,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:02,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:02,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 117 states have (on average 1.017094017094017) internal successors, (119), 117 states have internal predecessors, (119), 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-27 10:17:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2022-04-27 10:17:02,954 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 60 [2022-04-27 10:17:02,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:02,955 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2022-04-27 10:17:02,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2022-04-27 10:17:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-04-27 10:17:02,958 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:02,958 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:02,971 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-27 10:17:03,165 WARN L477 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-27 10:17:03,165 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:03,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:03,166 INFO L85 PathProgramCache]: Analyzing trace with hash -666663140, now seen corresponding path program 4 times [2022-04-27 10:17:03,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:03,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565174804] [2022-04-27 10:17:03,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:03,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {2103#(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); {2075#true} is VALID [2022-04-27 10:17:03,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {2075#true} assume true; {2075#true} is VALID [2022-04-27 10:17:03,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2075#true} {2075#true} #43#return; {2075#true} is VALID [2022-04-27 10:17:03,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {2075#true} call ULTIMATE.init(); {2103#(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-27 10:17:03,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {2103#(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); {2075#true} is VALID [2022-04-27 10:17:03,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {2075#true} assume true; {2075#true} is VALID [2022-04-27 10:17:03,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2075#true} {2075#true} #43#return; {2075#true} is VALID [2022-04-27 10:17:03,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {2075#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2075#true} is VALID [2022-04-27 10:17:03,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {2075#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; {2080#(= main_~i~0 0)} is VALID [2022-04-27 10:17:03,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {2080#(= 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; {2080#(= main_~i~0 0)} is VALID [2022-04-27 10:17:03,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {2080#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2081#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:17:03,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {2081#(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; {2081#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:17:03,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {2081#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2082#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:17:03,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {2082#(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; {2082#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:17:03,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {2082#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2083#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:17:03,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {2083#(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; {2083#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:17:03,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {2083#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2084#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:17:03,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {2084#(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; {2084#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:17:03,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {2084#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2085#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 10:17:03,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {2085#(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; {2085#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 10:17:03,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {2085#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2086#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 10:17:03,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {2086#(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; {2086#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 10:17:03,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {2086#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2087#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 10:17:03,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {2087#(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; {2087#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 10:17:03,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {2087#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2088#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-27 10:17:03,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {2088#(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; {2088#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-27 10:17:03,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {2088#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2089#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-27 10:17:03,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {2089#(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; {2089#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-27 10:17:03,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {2089#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2090#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-27 10:17:03,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {2090#(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; {2090#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-27 10:17:03,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {2090#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2091#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-27 10:17:03,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {2091#(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; {2091#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-27 10:17:03,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {2091#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2092#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-27 10:17:03,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {2092#(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; {2092#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-27 10:17:03,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {2092#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2093#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-27 10:17:03,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {2093#(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; {2093#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-27 10:17:03,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {2093#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2094#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-27 10:17:03,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {2094#(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; {2094#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-27 10:17:03,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {2094#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2095#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-27 10:17:03,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {2095#(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; {2095#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-27 10:17:03,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {2095#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2096#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-27 10:17:03,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {2096#(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; {2096#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-27 10:17:03,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {2096#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2097#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-27 10:17:03,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {2097#(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; {2097#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-27 10:17:03,799 INFO L290 TraceCheckUtils]: 41: Hoare triple {2097#(and (<= 17 main_~i~0) (<= main_~i~0 17))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2098#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-27 10:17:03,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {2098#(and (<= main_~i~0 18) (<= 18 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; {2098#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-27 10:17:03,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {2098#(and (<= main_~i~0 18) (<= 18 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2099#(and (<= 19 main_~i~0) (<= main_~i~0 19))} is VALID [2022-04-27 10:17:03,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {2099#(and (<= 19 main_~i~0) (<= main_~i~0 19))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2099#(and (<= 19 main_~i~0) (<= main_~i~0 19))} is VALID [2022-04-27 10:17:03,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {2099#(and (<= 19 main_~i~0) (<= main_~i~0 19))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2100#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-27 10:17:03,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {2100#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2100#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-27 10:17:03,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {2100#(and (<= 20 main_~i~0) (<= main_~i~0 20))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2101#(and (<= main_~i~0 21) (<= 21 main_~i~0))} is VALID [2022-04-27 10:17:03,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {2101#(and (<= main_~i~0 21) (<= 21 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; {2101#(and (<= main_~i~0 21) (<= 21 main_~i~0))} is VALID [2022-04-27 10:17:03,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {2101#(and (<= main_~i~0 21) (<= 21 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2102#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 22))} is VALID [2022-04-27 10:17:03,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {2102#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 22))} assume !(~i~0 % 4294967296 < 102400); {2076#false} is VALID [2022-04-27 10:17:03,803 INFO L290 TraceCheckUtils]: 51: Hoare triple {2076#false} ~i~0 := 0; {2076#false} is VALID [2022-04-27 10:17:03,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,803 INFO L290 TraceCheckUtils]: 53: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,803 INFO L290 TraceCheckUtils]: 55: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,803 INFO L290 TraceCheckUtils]: 56: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,803 INFO L290 TraceCheckUtils]: 58: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,803 INFO L290 TraceCheckUtils]: 59: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,803 INFO L290 TraceCheckUtils]: 60: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,803 INFO L290 TraceCheckUtils]: 61: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,803 INFO L290 TraceCheckUtils]: 62: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,803 INFO L290 TraceCheckUtils]: 63: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,803 INFO L290 TraceCheckUtils]: 64: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,804 INFO L290 TraceCheckUtils]: 65: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,804 INFO L290 TraceCheckUtils]: 66: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,804 INFO L290 TraceCheckUtils]: 67: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,804 INFO L290 TraceCheckUtils]: 68: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,804 INFO L290 TraceCheckUtils]: 69: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,804 INFO L290 TraceCheckUtils]: 70: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,804 INFO L290 TraceCheckUtils]: 71: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,804 INFO L290 TraceCheckUtils]: 72: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,804 INFO L290 TraceCheckUtils]: 73: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,804 INFO L290 TraceCheckUtils]: 74: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,804 INFO L290 TraceCheckUtils]: 75: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,804 INFO L290 TraceCheckUtils]: 76: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,804 INFO L290 TraceCheckUtils]: 77: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,804 INFO L290 TraceCheckUtils]: 78: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,804 INFO L290 TraceCheckUtils]: 79: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,804 INFO L290 TraceCheckUtils]: 80: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 81: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 82: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 83: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 84: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 85: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 86: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 87: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 88: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 89: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 90: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 91: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 92: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 93: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 94: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 95: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 96: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,805 INFO L290 TraceCheckUtils]: 97: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 98: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 99: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 100: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 101: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 102: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 103: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 104: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 105: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 106: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 107: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 108: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 109: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 110: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 111: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 112: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 113: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,806 INFO L290 TraceCheckUtils]: 114: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,807 INFO L290 TraceCheckUtils]: 115: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:03,807 INFO L290 TraceCheckUtils]: 116: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:03,807 INFO L290 TraceCheckUtils]: 117: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:03,807 INFO L290 TraceCheckUtils]: 118: Hoare triple {2076#false} assume !(~i~0 % 4294967296 < 102400); {2076#false} is VALID [2022-04-27 10:17:03,807 INFO L290 TraceCheckUtils]: 119: Hoare triple {2076#false} assume !false; {2076#false} is VALID [2022-04-27 10:17:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-04-27 10:17:03,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:03,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565174804] [2022-04-27 10:17:03,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565174804] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:03,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778280080] [2022-04-27 10:17:03,808 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:17:03,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:03,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:03,811 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-27 10:17:03,812 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-27 10:17:04,690 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:17:04,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:17:04,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-27 10:17:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:05,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {2075#true} call ULTIMATE.init(); {2075#true} is VALID [2022-04-27 10:17:05,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {2075#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); {2075#true} is VALID [2022-04-27 10:17:05,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {2075#true} assume true; {2075#true} is VALID [2022-04-27 10:17:05,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2075#true} {2075#true} #43#return; {2075#true} is VALID [2022-04-27 10:17:05,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {2075#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2075#true} is VALID [2022-04-27 10:17:05,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {2075#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; {2080#(= main_~i~0 0)} is VALID [2022-04-27 10:17:05,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {2080#(= 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; {2080#(= main_~i~0 0)} is VALID [2022-04-27 10:17:05,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {2080#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2081#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:17:05,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {2081#(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; {2081#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:17:05,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {2081#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2082#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:17:05,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {2082#(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; {2082#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:17:05,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {2082#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2083#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:17:05,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {2083#(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; {2083#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:17:05,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {2083#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2084#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:17:05,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {2084#(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; {2084#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:17:05,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {2084#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2085#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 10:17:05,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {2085#(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; {2085#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 10:17:05,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {2085#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2086#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 10:17:05,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {2086#(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; {2086#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 10:17:05,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {2086#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2087#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 10:17:05,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {2087#(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; {2087#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 10:17:05,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {2087#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2088#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-27 10:17:05,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {2088#(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; {2088#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-27 10:17:05,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {2088#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2089#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-27 10:17:05,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {2089#(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; {2089#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-27 10:17:05,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {2089#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2090#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-27 10:17:05,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {2090#(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; {2090#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-27 10:17:05,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {2090#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2091#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-27 10:17:05,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {2091#(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; {2091#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-27 10:17:05,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {2091#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2092#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-27 10:17:05,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {2092#(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; {2092#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-27 10:17:05,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {2092#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2093#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-27 10:17:05,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {2093#(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; {2093#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-27 10:17:05,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {2093#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2094#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-27 10:17:05,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {2094#(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; {2094#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-27 10:17:05,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {2094#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2095#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-27 10:17:05,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {2095#(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; {2095#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-27 10:17:05,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {2095#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2096#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-27 10:17:05,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {2096#(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; {2096#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-27 10:17:05,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {2096#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2097#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-27 10:17:05,375 INFO L290 TraceCheckUtils]: 40: Hoare triple {2097#(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; {2097#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-27 10:17:05,375 INFO L290 TraceCheckUtils]: 41: Hoare triple {2097#(and (<= 17 main_~i~0) (<= main_~i~0 17))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2098#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-27 10:17:05,375 INFO L290 TraceCheckUtils]: 42: Hoare triple {2098#(and (<= main_~i~0 18) (<= 18 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; {2098#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-27 10:17:05,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {2098#(and (<= main_~i~0 18) (<= 18 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2099#(and (<= 19 main_~i~0) (<= main_~i~0 19))} is VALID [2022-04-27 10:17:05,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {2099#(and (<= 19 main_~i~0) (<= main_~i~0 19))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2099#(and (<= 19 main_~i~0) (<= main_~i~0 19))} is VALID [2022-04-27 10:17:05,377 INFO L290 TraceCheckUtils]: 45: Hoare triple {2099#(and (<= 19 main_~i~0) (<= main_~i~0 19))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2100#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-27 10:17:05,377 INFO L290 TraceCheckUtils]: 46: Hoare triple {2100#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {2100#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-27 10:17:05,378 INFO L290 TraceCheckUtils]: 47: Hoare triple {2100#(and (<= 20 main_~i~0) (<= main_~i~0 20))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2101#(and (<= main_~i~0 21) (<= 21 main_~i~0))} is VALID [2022-04-27 10:17:05,378 INFO L290 TraceCheckUtils]: 48: Hoare triple {2101#(and (<= main_~i~0 21) (<= 21 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; {2101#(and (<= main_~i~0 21) (<= 21 main_~i~0))} is VALID [2022-04-27 10:17:05,378 INFO L290 TraceCheckUtils]: 49: Hoare triple {2101#(and (<= main_~i~0 21) (<= 21 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2254#(and (<= 22 main_~i~0) (<= main_~i~0 22))} is VALID [2022-04-27 10:17:05,379 INFO L290 TraceCheckUtils]: 50: Hoare triple {2254#(and (<= 22 main_~i~0) (<= main_~i~0 22))} assume !(~i~0 % 4294967296 < 102400); {2076#false} is VALID [2022-04-27 10:17:05,379 INFO L290 TraceCheckUtils]: 51: Hoare triple {2076#false} ~i~0 := 0; {2076#false} is VALID [2022-04-27 10:17:05,379 INFO L290 TraceCheckUtils]: 52: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,379 INFO L290 TraceCheckUtils]: 53: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,379 INFO L290 TraceCheckUtils]: 54: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,379 INFO L290 TraceCheckUtils]: 55: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,379 INFO L290 TraceCheckUtils]: 56: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,379 INFO L290 TraceCheckUtils]: 57: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,379 INFO L290 TraceCheckUtils]: 58: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,379 INFO L290 TraceCheckUtils]: 59: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,379 INFO L290 TraceCheckUtils]: 60: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,380 INFO L290 TraceCheckUtils]: 61: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,380 INFO L290 TraceCheckUtils]: 62: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,380 INFO L290 TraceCheckUtils]: 63: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,380 INFO L290 TraceCheckUtils]: 64: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,380 INFO L290 TraceCheckUtils]: 65: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,380 INFO L290 TraceCheckUtils]: 66: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,380 INFO L290 TraceCheckUtils]: 67: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,380 INFO L290 TraceCheckUtils]: 68: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,380 INFO L290 TraceCheckUtils]: 69: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,380 INFO L290 TraceCheckUtils]: 70: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,380 INFO L290 TraceCheckUtils]: 71: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,380 INFO L290 TraceCheckUtils]: 72: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,380 INFO L290 TraceCheckUtils]: 73: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,380 INFO L290 TraceCheckUtils]: 74: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,380 INFO L290 TraceCheckUtils]: 75: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,380 INFO L290 TraceCheckUtils]: 76: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 77: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 78: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 79: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 80: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 81: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 82: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 83: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 84: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 85: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 86: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 87: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 88: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 89: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 90: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 91: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 92: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,381 INFO L290 TraceCheckUtils]: 93: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,382 INFO L290 TraceCheckUtils]: 94: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,382 INFO L290 TraceCheckUtils]: 95: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,382 INFO L290 TraceCheckUtils]: 96: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,382 INFO L290 TraceCheckUtils]: 97: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,382 INFO L290 TraceCheckUtils]: 98: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,382 INFO L290 TraceCheckUtils]: 99: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,382 INFO L290 TraceCheckUtils]: 100: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,382 INFO L290 TraceCheckUtils]: 101: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,382 INFO L290 TraceCheckUtils]: 102: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,382 INFO L290 TraceCheckUtils]: 103: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,382 INFO L290 TraceCheckUtils]: 104: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,382 INFO L290 TraceCheckUtils]: 105: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,382 INFO L290 TraceCheckUtils]: 106: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,382 INFO L290 TraceCheckUtils]: 107: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,382 INFO L290 TraceCheckUtils]: 108: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,382 INFO L290 TraceCheckUtils]: 109: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,383 INFO L290 TraceCheckUtils]: 110: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,383 INFO L290 TraceCheckUtils]: 111: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,383 INFO L290 TraceCheckUtils]: 112: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,383 INFO L290 TraceCheckUtils]: 113: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,383 INFO L290 TraceCheckUtils]: 114: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,383 INFO L290 TraceCheckUtils]: 115: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:05,383 INFO L290 TraceCheckUtils]: 116: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:05,383 INFO L290 TraceCheckUtils]: 117: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:05,383 INFO L290 TraceCheckUtils]: 118: Hoare triple {2076#false} assume !(~i~0 % 4294967296 < 102400); {2076#false} is VALID [2022-04-27 10:17:05,383 INFO L290 TraceCheckUtils]: 119: Hoare triple {2076#false} assume !false; {2076#false} is VALID [2022-04-27 10:17:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-04-27 10:17:05,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:06,479 INFO L290 TraceCheckUtils]: 119: Hoare triple {2076#false} assume !false; {2076#false} is VALID [2022-04-27 10:17:06,480 INFO L290 TraceCheckUtils]: 118: Hoare triple {2076#false} assume !(~i~0 % 4294967296 < 102400); {2076#false} is VALID [2022-04-27 10:17:06,480 INFO L290 TraceCheckUtils]: 117: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,480 INFO L290 TraceCheckUtils]: 116: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,480 INFO L290 TraceCheckUtils]: 115: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,480 INFO L290 TraceCheckUtils]: 114: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,480 INFO L290 TraceCheckUtils]: 113: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,480 INFO L290 TraceCheckUtils]: 112: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,480 INFO L290 TraceCheckUtils]: 111: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,480 INFO L290 TraceCheckUtils]: 110: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,480 INFO L290 TraceCheckUtils]: 109: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,480 INFO L290 TraceCheckUtils]: 108: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,480 INFO L290 TraceCheckUtils]: 107: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,480 INFO L290 TraceCheckUtils]: 106: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,480 INFO L290 TraceCheckUtils]: 105: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,481 INFO L290 TraceCheckUtils]: 104: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,481 INFO L290 TraceCheckUtils]: 103: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,481 INFO L290 TraceCheckUtils]: 102: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,481 INFO L290 TraceCheckUtils]: 101: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,481 INFO L290 TraceCheckUtils]: 100: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,481 INFO L290 TraceCheckUtils]: 99: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,481 INFO L290 TraceCheckUtils]: 98: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,481 INFO L290 TraceCheckUtils]: 97: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,481 INFO L290 TraceCheckUtils]: 96: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,481 INFO L290 TraceCheckUtils]: 95: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,481 INFO L290 TraceCheckUtils]: 94: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,481 INFO L290 TraceCheckUtils]: 93: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,481 INFO L290 TraceCheckUtils]: 92: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,481 INFO L290 TraceCheckUtils]: 91: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,481 INFO L290 TraceCheckUtils]: 90: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,481 INFO L290 TraceCheckUtils]: 89: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,482 INFO L290 TraceCheckUtils]: 88: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,482 INFO L290 TraceCheckUtils]: 87: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,482 INFO L290 TraceCheckUtils]: 86: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,482 INFO L290 TraceCheckUtils]: 85: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,482 INFO L290 TraceCheckUtils]: 84: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,482 INFO L290 TraceCheckUtils]: 83: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,482 INFO L290 TraceCheckUtils]: 82: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,482 INFO L290 TraceCheckUtils]: 81: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,482 INFO L290 TraceCheckUtils]: 80: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,482 INFO L290 TraceCheckUtils]: 79: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,482 INFO L290 TraceCheckUtils]: 78: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,482 INFO L290 TraceCheckUtils]: 77: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,482 INFO L290 TraceCheckUtils]: 76: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,482 INFO L290 TraceCheckUtils]: 75: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,482 INFO L290 TraceCheckUtils]: 74: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,483 INFO L290 TraceCheckUtils]: 73: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,483 INFO L290 TraceCheckUtils]: 72: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,483 INFO L290 TraceCheckUtils]: 71: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,483 INFO L290 TraceCheckUtils]: 70: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,483 INFO L290 TraceCheckUtils]: 69: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,483 INFO L290 TraceCheckUtils]: 68: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,483 INFO L290 TraceCheckUtils]: 67: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,483 INFO L290 TraceCheckUtils]: 66: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,483 INFO L290 TraceCheckUtils]: 65: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,483 INFO L290 TraceCheckUtils]: 64: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,483 INFO L290 TraceCheckUtils]: 63: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,483 INFO L290 TraceCheckUtils]: 62: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,483 INFO L290 TraceCheckUtils]: 61: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,483 INFO L290 TraceCheckUtils]: 60: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,483 INFO L290 TraceCheckUtils]: 59: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,483 INFO L290 TraceCheckUtils]: 58: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,484 INFO L290 TraceCheckUtils]: 57: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,484 INFO L290 TraceCheckUtils]: 56: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,484 INFO L290 TraceCheckUtils]: 55: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,484 INFO L290 TraceCheckUtils]: 54: Hoare triple {2076#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2076#false} is VALID [2022-04-27 10:17:06,484 INFO L290 TraceCheckUtils]: 53: Hoare triple {2076#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2076#false} is VALID [2022-04-27 10:17:06,484 INFO L290 TraceCheckUtils]: 52: Hoare triple {2076#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2076#false} is VALID [2022-04-27 10:17:06,484 INFO L290 TraceCheckUtils]: 51: Hoare triple {2076#false} ~i~0 := 0; {2076#false} is VALID [2022-04-27 10:17:06,484 INFO L290 TraceCheckUtils]: 50: Hoare triple {2672#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 < 102400); {2076#false} is VALID [2022-04-27 10:17:06,485 INFO L290 TraceCheckUtils]: 49: Hoare triple {2676#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2672#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-27 10:17:06,485 INFO L290 TraceCheckUtils]: 48: Hoare triple {2676#(< (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; {2676#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,486 INFO L290 TraceCheckUtils]: 47: Hoare triple {2683#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2676#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,486 INFO L290 TraceCheckUtils]: 46: Hoare triple {2683#(< (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; {2683#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {2690#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2683#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,487 INFO L290 TraceCheckUtils]: 44: Hoare triple {2690#(< (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; {2690#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,487 INFO L290 TraceCheckUtils]: 43: Hoare triple {2697#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2690#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,487 INFO L290 TraceCheckUtils]: 42: Hoare triple {2697#(< (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; {2697#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,488 INFO L290 TraceCheckUtils]: 41: Hoare triple {2704#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2697#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {2704#(< (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; {2704#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,489 INFO L290 TraceCheckUtils]: 39: Hoare triple {2711#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2704#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,489 INFO L290 TraceCheckUtils]: 38: Hoare triple {2711#(< (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; {2711#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,489 INFO L290 TraceCheckUtils]: 37: Hoare triple {2718#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2711#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {2718#(< (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; {2718#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {2725#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2718#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {2725#(< (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; {2725#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {2732#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2725#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {2732#(< (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; {2732#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {2739#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2732#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {2739#(< (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; {2739#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {2746#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2739#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {2746#(< (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; {2746#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {2753#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2746#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {2753#(< (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; {2753#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {2760#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2753#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {2760#(< (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; {2760#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {2767#(< (mod (+ main_~i~0 14) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2760#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {2767#(< (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; {2767#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {2774#(< (mod (+ main_~i~0 15) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2767#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {2774#(< (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; {2774#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {2781#(< (mod (+ main_~i~0 16) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2774#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {2781#(< (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; {2781#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {2788#(< (mod (+ main_~i~0 17) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2781#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {2788#(< (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; {2788#(< (mod (+ main_~i~0 17) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {2795#(< (mod (+ main_~i~0 18) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2788#(< (mod (+ main_~i~0 17) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {2795#(< (mod (+ main_~i~0 18) 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; {2795#(< (mod (+ main_~i~0 18) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {2802#(< (mod (+ 19 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2795#(< (mod (+ main_~i~0 18) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {2802#(< (mod (+ 19 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; {2802#(< (mod (+ 19 main_~i~0) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {2809#(< (mod (+ main_~i~0 20) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2802#(< (mod (+ 19 main_~i~0) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {2809#(< (mod (+ main_~i~0 20) 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; {2809#(< (mod (+ main_~i~0 20) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {2816#(< (mod (+ main_~i~0 21) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2809#(< (mod (+ main_~i~0 20) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {2816#(< (mod (+ main_~i~0 21) 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; {2816#(< (mod (+ main_~i~0 21) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {2823#(< (mod (+ main_~i~0 22) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2816#(< (mod (+ main_~i~0 21) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {2823#(< (mod (+ main_~i~0 22) 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; {2823#(< (mod (+ main_~i~0 22) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {2075#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; {2823#(< (mod (+ main_~i~0 22) 4294967296) 102400)} is VALID [2022-04-27 10:17:06,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {2075#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2075#true} is VALID [2022-04-27 10:17:06,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2075#true} {2075#true} #43#return; {2075#true} is VALID [2022-04-27 10:17:06,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {2075#true} assume true; {2075#true} is VALID [2022-04-27 10:17:06,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {2075#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); {2075#true} is VALID [2022-04-27 10:17:06,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {2075#true} call ULTIMATE.init(); {2075#true} is VALID [2022-04-27 10:17:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-04-27 10:17:06,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778280080] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:06,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:06,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-27 10:17:06,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482917135] [2022-04-27 10:17:06,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:06,514 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.06) internal successors, (103), 49 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2022-04-27 10:17:06,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:06,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.06) internal successors, (103), 49 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:06,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:06,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 10:17:06,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:06,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 10:17:06,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 10:17:06,593 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 50 states, 50 states have (on average 2.06) internal successors, (103), 49 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:38,341 INFO L93 Difference]: Finished difference Result 311 states and 360 transitions. [2022-04-27 10:18:38,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-27 10:18:38,341 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.06) internal successors, (103), 49 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2022-04-27 10:18:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.06) internal successors, (103), 49 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 296 transitions. [2022-04-27 10:18:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.06) internal successors, (103), 49 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 296 transitions. [2022-04-27 10:18:38,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 296 transitions. [2022-04-27 10:18:38,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:38,762 INFO L225 Difference]: With dead ends: 311 [2022-04-27 10:18:38,762 INFO L226 Difference]: Without dead ends: 241 [2022-04-27 10:18:38,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 85.6s TimeCoverageRelationStatistics Valid=1799, Invalid=3456, Unknown=1, NotChecked=0, Total=5256 [2022-04-27 10:18:38,764 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 859 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:38,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 679 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 10:18:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-04-27 10:18:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-04-27 10:18:38,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:38,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand has 241 states, 237 states have (on average 1.0084388185654007) internal successors, (239), 237 states have internal predecessors, (239), 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-27 10:18:38,877 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand has 241 states, 237 states have (on average 1.0084388185654007) internal successors, (239), 237 states have internal predecessors, (239), 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-27 10:18:38,878 INFO L87 Difference]: Start difference. First operand 241 states. Second operand has 241 states, 237 states have (on average 1.0084388185654007) internal successors, (239), 237 states have internal predecessors, (239), 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-27 10:18:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:38,882 INFO L93 Difference]: Finished difference Result 241 states and 242 transitions. [2022-04-27 10:18:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2022-04-27 10:18:38,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:38,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:38,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 241 states, 237 states have (on average 1.0084388185654007) internal successors, (239), 237 states have internal predecessors, (239), 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 241 states. [2022-04-27 10:18:38,883 INFO L87 Difference]: Start difference. First operand has 241 states, 237 states have (on average 1.0084388185654007) internal successors, (239), 237 states have internal predecessors, (239), 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 241 states. [2022-04-27 10:18:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:38,887 INFO L93 Difference]: Finished difference Result 241 states and 242 transitions. [2022-04-27 10:18:38,887 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2022-04-27 10:18:38,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:38,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:38,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:38,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 237 states have (on average 1.0084388185654007) internal successors, (239), 237 states have internal predecessors, (239), 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-27 10:18:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2022-04-27 10:18:38,893 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 120 [2022-04-27 10:18:38,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:38,893 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2022-04-27 10:18:38,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.06) internal successors, (103), 49 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2022-04-27 10:18:38,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-04-27 10:18:38,895 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:38,895 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:38,913 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-27 10:18:39,103 WARN L477 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-27 10:18:39,103 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:39,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:39,104 INFO L85 PathProgramCache]: Analyzing trace with hash 556708300, now seen corresponding path program 5 times [2022-04-27 10:18:39,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:39,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637199782] [2022-04-27 10:18:39,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:39,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:40,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {4198#(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); {4146#true} is VALID [2022-04-27 10:18:40,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {4146#true} assume true; {4146#true} is VALID [2022-04-27 10:18:40,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4146#true} {4146#true} #43#return; {4146#true} is VALID [2022-04-27 10:18:40,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {4146#true} call ULTIMATE.init(); {4198#(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-27 10:18:40,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {4198#(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); {4146#true} is VALID [2022-04-27 10:18:40,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {4146#true} assume true; {4146#true} is VALID [2022-04-27 10:18:40,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4146#true} {4146#true} #43#return; {4146#true} is VALID [2022-04-27 10:18:40,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {4146#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {4146#true} is VALID [2022-04-27 10:18:40,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {4146#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; {4151#(= main_~i~0 0)} is VALID [2022-04-27 10:18:40,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {4151#(= 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; {4151#(= main_~i~0 0)} is VALID [2022-04-27 10:18:40,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {4151#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4152#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:18:40,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {4152#(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; {4152#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:18:40,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {4152#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4153#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:40,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {4153#(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; {4153#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:40,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {4153#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4154#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:40,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {4154#(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; {4154#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:40,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {4154#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4155#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:18:40,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {4155#(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; {4155#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-27 10:18:40,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {4155#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4156#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 10:18:40,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {4156#(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; {4156#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-27 10:18:40,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {4156#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4157#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 10:18:40,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {4157#(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; {4157#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-27 10:18:40,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {4157#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4158#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 10:18:40,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {4158#(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; {4158#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 10:18:40,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {4158#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4159#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-27 10:18:40,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {4159#(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; {4159#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-27 10:18:40,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {4159#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4160#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-27 10:18:40,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {4160#(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; {4160#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-27 10:18:40,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {4160#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4161#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-27 10:18:40,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {4161#(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; {4161#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-27 10:18:40,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {4161#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4162#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-27 10:18:40,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {4162#(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; {4162#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-27 10:18:40,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {4162#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4163#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-27 10:18:40,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {4163#(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; {4163#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-27 10:18:40,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {4163#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4164#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-27 10:18:40,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {4164#(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; {4164#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-27 10:18:40,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {4164#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4165#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-27 10:18:40,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {4165#(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; {4165#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-27 10:18:40,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {4165#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4166#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-27 10:18:40,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {4166#(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; {4166#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-27 10:18:40,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {4166#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4167#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-27 10:18:40,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {4167#(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; {4167#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-27 10:18:40,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {4167#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4168#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-27 10:18:40,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {4168#(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; {4168#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-27 10:18:40,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {4168#(and (<= 17 main_~i~0) (<= main_~i~0 17))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4169#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-27 10:18:40,814 INFO L290 TraceCheckUtils]: 42: Hoare triple {4169#(and (<= main_~i~0 18) (<= 18 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; {4169#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-27 10:18:40,814 INFO L290 TraceCheckUtils]: 43: Hoare triple {4169#(and (<= main_~i~0 18) (<= 18 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4170#(and (<= 19 main_~i~0) (<= main_~i~0 19))} is VALID [2022-04-27 10:18:40,815 INFO L290 TraceCheckUtils]: 44: Hoare triple {4170#(and (<= 19 main_~i~0) (<= main_~i~0 19))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4170#(and (<= 19 main_~i~0) (<= main_~i~0 19))} is VALID [2022-04-27 10:18:40,815 INFO L290 TraceCheckUtils]: 45: Hoare triple {4170#(and (<= 19 main_~i~0) (<= main_~i~0 19))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4171#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-27 10:18:40,815 INFO L290 TraceCheckUtils]: 46: Hoare triple {4171#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4171#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-27 10:18:40,816 INFO L290 TraceCheckUtils]: 47: Hoare triple {4171#(and (<= 20 main_~i~0) (<= main_~i~0 20))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4172#(and (<= main_~i~0 21) (<= 21 main_~i~0))} is VALID [2022-04-27 10:18:40,816 INFO L290 TraceCheckUtils]: 48: Hoare triple {4172#(and (<= main_~i~0 21) (<= 21 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; {4172#(and (<= main_~i~0 21) (<= 21 main_~i~0))} is VALID [2022-04-27 10:18:40,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {4172#(and (<= main_~i~0 21) (<= 21 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4173#(and (<= 22 main_~i~0) (<= main_~i~0 22))} is VALID [2022-04-27 10:18:40,817 INFO L290 TraceCheckUtils]: 50: Hoare triple {4173#(and (<= 22 main_~i~0) (<= main_~i~0 22))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4173#(and (<= 22 main_~i~0) (<= main_~i~0 22))} is VALID [2022-04-27 10:18:40,817 INFO L290 TraceCheckUtils]: 51: Hoare triple {4173#(and (<= 22 main_~i~0) (<= main_~i~0 22))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4174#(and (<= 23 main_~i~0) (<= main_~i~0 23))} is VALID [2022-04-27 10:18:40,818 INFO L290 TraceCheckUtils]: 52: Hoare triple {4174#(and (<= 23 main_~i~0) (<= main_~i~0 23))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4174#(and (<= 23 main_~i~0) (<= main_~i~0 23))} is VALID [2022-04-27 10:18:40,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {4174#(and (<= 23 main_~i~0) (<= main_~i~0 23))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4175#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-27 10:18:40,818 INFO L290 TraceCheckUtils]: 54: Hoare triple {4175#(and (<= 24 main_~i~0) (<= main_~i~0 24))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4175#(and (<= 24 main_~i~0) (<= main_~i~0 24))} is VALID [2022-04-27 10:18:40,819 INFO L290 TraceCheckUtils]: 55: Hoare triple {4175#(and (<= 24 main_~i~0) (<= main_~i~0 24))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4176#(and (<= 25 main_~i~0) (<= main_~i~0 25))} is VALID [2022-04-27 10:18:40,819 INFO L290 TraceCheckUtils]: 56: Hoare triple {4176#(and (<= 25 main_~i~0) (<= main_~i~0 25))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4176#(and (<= 25 main_~i~0) (<= main_~i~0 25))} is VALID [2022-04-27 10:18:40,820 INFO L290 TraceCheckUtils]: 57: Hoare triple {4176#(and (<= 25 main_~i~0) (<= main_~i~0 25))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4177#(and (<= main_~i~0 26) (<= 26 main_~i~0))} is VALID [2022-04-27 10:18:40,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {4177#(and (<= main_~i~0 26) (<= 26 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; {4177#(and (<= main_~i~0 26) (<= 26 main_~i~0))} is VALID [2022-04-27 10:18:40,820 INFO L290 TraceCheckUtils]: 59: Hoare triple {4177#(and (<= main_~i~0 26) (<= 26 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4178#(and (<= main_~i~0 27) (<= 27 main_~i~0))} is VALID [2022-04-27 10:18:40,821 INFO L290 TraceCheckUtils]: 60: Hoare triple {4178#(and (<= main_~i~0 27) (<= 27 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; {4178#(and (<= main_~i~0 27) (<= 27 main_~i~0))} is VALID [2022-04-27 10:18:40,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {4178#(and (<= main_~i~0 27) (<= 27 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4179#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-27 10:18:40,835 INFO L290 TraceCheckUtils]: 62: Hoare triple {4179#(and (<= main_~i~0 28) (<= 28 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; {4179#(and (<= main_~i~0 28) (<= 28 main_~i~0))} is VALID [2022-04-27 10:18:40,836 INFO L290 TraceCheckUtils]: 63: Hoare triple {4179#(and (<= main_~i~0 28) (<= 28 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4180#(and (<= main_~i~0 29) (<= 29 main_~i~0))} is VALID [2022-04-27 10:18:40,837 INFO L290 TraceCheckUtils]: 64: Hoare triple {4180#(and (<= main_~i~0 29) (<= 29 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; {4180#(and (<= main_~i~0 29) (<= 29 main_~i~0))} is VALID [2022-04-27 10:18:40,837 INFO L290 TraceCheckUtils]: 65: Hoare triple {4180#(and (<= main_~i~0 29) (<= 29 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4181#(and (<= 30 main_~i~0) (<= main_~i~0 30))} is VALID [2022-04-27 10:18:40,838 INFO L290 TraceCheckUtils]: 66: Hoare triple {4181#(and (<= 30 main_~i~0) (<= main_~i~0 30))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4181#(and (<= 30 main_~i~0) (<= main_~i~0 30))} is VALID [2022-04-27 10:18:40,838 INFO L290 TraceCheckUtils]: 67: Hoare triple {4181#(and (<= 30 main_~i~0) (<= main_~i~0 30))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4182#(and (<= 31 main_~i~0) (<= main_~i~0 31))} is VALID [2022-04-27 10:18:40,838 INFO L290 TraceCheckUtils]: 68: Hoare triple {4182#(and (<= 31 main_~i~0) (<= main_~i~0 31))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4182#(and (<= 31 main_~i~0) (<= main_~i~0 31))} is VALID [2022-04-27 10:18:40,839 INFO L290 TraceCheckUtils]: 69: Hoare triple {4182#(and (<= 31 main_~i~0) (<= main_~i~0 31))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4183#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-27 10:18:40,839 INFO L290 TraceCheckUtils]: 70: Hoare triple {4183#(and (<= main_~i~0 32) (<= 32 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; {4183#(and (<= main_~i~0 32) (<= 32 main_~i~0))} is VALID [2022-04-27 10:18:40,840 INFO L290 TraceCheckUtils]: 71: Hoare triple {4183#(and (<= main_~i~0 32) (<= 32 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4184#(and (<= 33 main_~i~0) (<= main_~i~0 33))} is VALID [2022-04-27 10:18:40,840 INFO L290 TraceCheckUtils]: 72: Hoare triple {4184#(and (<= 33 main_~i~0) (<= main_~i~0 33))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4184#(and (<= 33 main_~i~0) (<= main_~i~0 33))} is VALID [2022-04-27 10:18:40,840 INFO L290 TraceCheckUtils]: 73: Hoare triple {4184#(and (<= 33 main_~i~0) (<= main_~i~0 33))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4185#(and (<= main_~i~0 34) (<= 34 main_~i~0))} is VALID [2022-04-27 10:18:40,841 INFO L290 TraceCheckUtils]: 74: Hoare triple {4185#(and (<= main_~i~0 34) (<= 34 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; {4185#(and (<= main_~i~0 34) (<= 34 main_~i~0))} is VALID [2022-04-27 10:18:40,841 INFO L290 TraceCheckUtils]: 75: Hoare triple {4185#(and (<= main_~i~0 34) (<= 34 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4186#(and (<= 35 main_~i~0) (<= main_~i~0 35))} is VALID [2022-04-27 10:18:40,842 INFO L290 TraceCheckUtils]: 76: Hoare triple {4186#(and (<= 35 main_~i~0) (<= main_~i~0 35))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4186#(and (<= 35 main_~i~0) (<= main_~i~0 35))} is VALID [2022-04-27 10:18:40,842 INFO L290 TraceCheckUtils]: 77: Hoare triple {4186#(and (<= 35 main_~i~0) (<= main_~i~0 35))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4187#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-27 10:18:40,842 INFO L290 TraceCheckUtils]: 78: Hoare triple {4187#(and (<= 36 main_~i~0) (<= main_~i~0 36))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4187#(and (<= 36 main_~i~0) (<= main_~i~0 36))} is VALID [2022-04-27 10:18:40,843 INFO L290 TraceCheckUtils]: 79: Hoare triple {4187#(and (<= 36 main_~i~0) (<= main_~i~0 36))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4188#(and (<= 37 main_~i~0) (<= main_~i~0 37))} is VALID [2022-04-27 10:18:40,843 INFO L290 TraceCheckUtils]: 80: Hoare triple {4188#(and (<= 37 main_~i~0) (<= main_~i~0 37))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4188#(and (<= 37 main_~i~0) (<= main_~i~0 37))} is VALID [2022-04-27 10:18:40,843 INFO L290 TraceCheckUtils]: 81: Hoare triple {4188#(and (<= 37 main_~i~0) (<= main_~i~0 37))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4189#(and (<= 38 main_~i~0) (<= main_~i~0 38))} is VALID [2022-04-27 10:18:40,844 INFO L290 TraceCheckUtils]: 82: Hoare triple {4189#(and (<= 38 main_~i~0) (<= main_~i~0 38))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4189#(and (<= 38 main_~i~0) (<= main_~i~0 38))} is VALID [2022-04-27 10:18:40,844 INFO L290 TraceCheckUtils]: 83: Hoare triple {4189#(and (<= 38 main_~i~0) (<= main_~i~0 38))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4190#(and (<= 39 main_~i~0) (<= main_~i~0 39))} is VALID [2022-04-27 10:18:40,845 INFO L290 TraceCheckUtils]: 84: Hoare triple {4190#(and (<= 39 main_~i~0) (<= main_~i~0 39))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4190#(and (<= 39 main_~i~0) (<= main_~i~0 39))} is VALID [2022-04-27 10:18:40,845 INFO L290 TraceCheckUtils]: 85: Hoare triple {4190#(and (<= 39 main_~i~0) (<= main_~i~0 39))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4191#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-27 10:18:40,845 INFO L290 TraceCheckUtils]: 86: Hoare triple {4191#(and (<= 40 main_~i~0) (<= main_~i~0 40))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4191#(and (<= 40 main_~i~0) (<= main_~i~0 40))} is VALID [2022-04-27 10:18:40,846 INFO L290 TraceCheckUtils]: 87: Hoare triple {4191#(and (<= 40 main_~i~0) (<= main_~i~0 40))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4192#(and (<= main_~i~0 41) (<= 41 main_~i~0))} is VALID [2022-04-27 10:18:40,846 INFO L290 TraceCheckUtils]: 88: Hoare triple {4192#(and (<= main_~i~0 41) (<= 41 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; {4192#(and (<= main_~i~0 41) (<= 41 main_~i~0))} is VALID [2022-04-27 10:18:40,846 INFO L290 TraceCheckUtils]: 89: Hoare triple {4192#(and (<= main_~i~0 41) (<= 41 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4193#(and (<= 42 main_~i~0) (<= main_~i~0 42))} is VALID [2022-04-27 10:18:40,847 INFO L290 TraceCheckUtils]: 90: Hoare triple {4193#(and (<= 42 main_~i~0) (<= main_~i~0 42))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4193#(and (<= 42 main_~i~0) (<= main_~i~0 42))} is VALID [2022-04-27 10:18:40,847 INFO L290 TraceCheckUtils]: 91: Hoare triple {4193#(and (<= 42 main_~i~0) (<= main_~i~0 42))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4194#(and (<= main_~i~0 43) (<= 43 main_~i~0))} is VALID [2022-04-27 10:18:40,848 INFO L290 TraceCheckUtils]: 92: Hoare triple {4194#(and (<= main_~i~0 43) (<= 43 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; {4194#(and (<= main_~i~0 43) (<= 43 main_~i~0))} is VALID [2022-04-27 10:18:40,849 INFO L290 TraceCheckUtils]: 93: Hoare triple {4194#(and (<= main_~i~0 43) (<= 43 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4195#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-27 10:18:40,849 INFO L290 TraceCheckUtils]: 94: Hoare triple {4195#(and (<= 44 main_~i~0) (<= main_~i~0 44))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4195#(and (<= 44 main_~i~0) (<= main_~i~0 44))} is VALID [2022-04-27 10:18:40,850 INFO L290 TraceCheckUtils]: 95: Hoare triple {4195#(and (<= 44 main_~i~0) (<= main_~i~0 44))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4196#(and (<= 45 main_~i~0) (<= main_~i~0 45))} is VALID [2022-04-27 10:18:40,850 INFO L290 TraceCheckUtils]: 96: Hoare triple {4196#(and (<= 45 main_~i~0) (<= main_~i~0 45))} assume !!(~i~0 % 4294967296 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet6; {4196#(and (<= 45 main_~i~0) (<= main_~i~0 45))} is VALID [2022-04-27 10:18:40,853 INFO L290 TraceCheckUtils]: 97: Hoare triple {4196#(and (<= 45 main_~i~0) (<= main_~i~0 45))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4197#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 46))} is VALID [2022-04-27 10:18:40,856 INFO L290 TraceCheckUtils]: 98: Hoare triple {4197#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 46))} assume !(~i~0 % 4294967296 < 102400); {4147#false} is VALID [2022-04-27 10:18:40,856 INFO L290 TraceCheckUtils]: 99: Hoare triple {4147#false} ~i~0 := 0; {4147#false} is VALID [2022-04-27 10:18:40,856 INFO L290 TraceCheckUtils]: 100: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 101: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 102: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 103: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 104: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 105: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 106: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 107: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 108: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 109: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 110: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 111: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 112: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 113: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 114: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 115: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 116: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,857 INFO L290 TraceCheckUtils]: 117: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,858 INFO L290 TraceCheckUtils]: 118: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,858 INFO L290 TraceCheckUtils]: 119: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,858 INFO L290 TraceCheckUtils]: 120: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,858 INFO L290 TraceCheckUtils]: 121: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,858 INFO L290 TraceCheckUtils]: 122: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,858 INFO L290 TraceCheckUtils]: 123: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,858 INFO L290 TraceCheckUtils]: 124: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,858 INFO L290 TraceCheckUtils]: 125: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,858 INFO L290 TraceCheckUtils]: 126: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,858 INFO L290 TraceCheckUtils]: 127: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,858 INFO L290 TraceCheckUtils]: 128: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,858 INFO L290 TraceCheckUtils]: 129: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,858 INFO L290 TraceCheckUtils]: 130: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,858 INFO L290 TraceCheckUtils]: 131: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,858 INFO L290 TraceCheckUtils]: 132: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,858 INFO L290 TraceCheckUtils]: 133: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,859 INFO L290 TraceCheckUtils]: 134: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,859 INFO L290 TraceCheckUtils]: 135: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,859 INFO L290 TraceCheckUtils]: 136: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,859 INFO L290 TraceCheckUtils]: 137: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,859 INFO L290 TraceCheckUtils]: 138: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,859 INFO L290 TraceCheckUtils]: 139: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,859 INFO L290 TraceCheckUtils]: 140: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,859 INFO L290 TraceCheckUtils]: 141: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,859 INFO L290 TraceCheckUtils]: 142: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,859 INFO L290 TraceCheckUtils]: 143: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,859 INFO L290 TraceCheckUtils]: 144: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,859 INFO L290 TraceCheckUtils]: 145: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,859 INFO L290 TraceCheckUtils]: 146: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,859 INFO L290 TraceCheckUtils]: 147: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,859 INFO L290 TraceCheckUtils]: 148: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,859 INFO L290 TraceCheckUtils]: 149: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,860 INFO L290 TraceCheckUtils]: 150: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,860 INFO L290 TraceCheckUtils]: 151: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,860 INFO L290 TraceCheckUtils]: 152: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,860 INFO L290 TraceCheckUtils]: 153: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,860 INFO L290 TraceCheckUtils]: 154: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,860 INFO L290 TraceCheckUtils]: 155: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,860 INFO L290 TraceCheckUtils]: 156: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,860 INFO L290 TraceCheckUtils]: 157: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,860 INFO L290 TraceCheckUtils]: 158: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,860 INFO L290 TraceCheckUtils]: 159: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,860 INFO L290 TraceCheckUtils]: 160: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,860 INFO L290 TraceCheckUtils]: 161: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,860 INFO L290 TraceCheckUtils]: 162: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,860 INFO L290 TraceCheckUtils]: 163: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,860 INFO L290 TraceCheckUtils]: 164: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,860 INFO L290 TraceCheckUtils]: 165: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 166: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 167: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 168: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 169: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 170: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 171: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 172: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 173: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 174: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 175: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 176: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 177: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 178: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 179: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 180: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 181: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,861 INFO L290 TraceCheckUtils]: 182: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,862 INFO L290 TraceCheckUtils]: 183: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,862 INFO L290 TraceCheckUtils]: 184: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,862 INFO L290 TraceCheckUtils]: 185: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,862 INFO L290 TraceCheckUtils]: 186: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,862 INFO L290 TraceCheckUtils]: 187: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,862 INFO L290 TraceCheckUtils]: 188: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,862 INFO L290 TraceCheckUtils]: 189: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,862 INFO L290 TraceCheckUtils]: 190: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,862 INFO L290 TraceCheckUtils]: 191: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,862 INFO L290 TraceCheckUtils]: 192: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,862 INFO L290 TraceCheckUtils]: 193: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,862 INFO L290 TraceCheckUtils]: 194: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,862 INFO L290 TraceCheckUtils]: 195: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,862 INFO L290 TraceCheckUtils]: 196: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,862 INFO L290 TraceCheckUtils]: 197: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,862 INFO L290 TraceCheckUtils]: 198: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 199: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 200: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 201: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 202: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 203: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 204: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 205: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 206: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 207: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 208: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 209: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 210: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 211: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 212: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 213: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 214: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,863 INFO L290 TraceCheckUtils]: 215: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,864 INFO L290 TraceCheckUtils]: 216: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,864 INFO L290 TraceCheckUtils]: 217: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,864 INFO L290 TraceCheckUtils]: 218: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,864 INFO L290 TraceCheckUtils]: 219: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,864 INFO L290 TraceCheckUtils]: 220: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,864 INFO L290 TraceCheckUtils]: 221: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,864 INFO L290 TraceCheckUtils]: 222: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,864 INFO L290 TraceCheckUtils]: 223: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,864 INFO L290 TraceCheckUtils]: 224: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,864 INFO L290 TraceCheckUtils]: 225: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,864 INFO L290 TraceCheckUtils]: 226: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,864 INFO L290 TraceCheckUtils]: 227: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,864 INFO L290 TraceCheckUtils]: 228: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,864 INFO L290 TraceCheckUtils]: 229: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,864 INFO L290 TraceCheckUtils]: 230: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,864 INFO L290 TraceCheckUtils]: 231: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,865 INFO L290 TraceCheckUtils]: 232: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,865 INFO L290 TraceCheckUtils]: 233: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,865 INFO L290 TraceCheckUtils]: 234: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,865 INFO L290 TraceCheckUtils]: 235: Hoare triple {4147#false} assume !!(~i~0 % 4294967296 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4147#false} is VALID [2022-04-27 10:18:40,865 INFO L290 TraceCheckUtils]: 236: Hoare triple {4147#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4147#false} is VALID [2022-04-27 10:18:40,865 INFO L290 TraceCheckUtils]: 237: Hoare triple {4147#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4147#false} is VALID [2022-04-27 10:18:40,865 INFO L290 TraceCheckUtils]: 238: Hoare triple {4147#false} assume !(~i~0 % 4294967296 < 102400); {4147#false} is VALID [2022-04-27 10:18:40,865 INFO L290 TraceCheckUtils]: 239: Hoare triple {4147#false} assume !false; {4147#false} is VALID [2022-04-27 10:18:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3151 trivial. 0 not checked. [2022-04-27 10:18:40,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:40,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637199782] [2022-04-27 10:18:40,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637199782] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:18:40,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475013907] [2022-04-27 10:18:40,867 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 10:18:40,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:18:40,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:18:40,868 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-27 10:18:40,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process