/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/compact.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:01:34,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:01:34,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:01:34,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:01:34,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:01:34,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:01:34,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:01:34,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:01:34,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:01:34,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:01:34,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:01:34,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:01:34,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:01:34,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:01:34,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:01:34,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:01:34,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:01:34,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:01:34,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:01:34,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:01:34,499 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:01:34,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:01:34,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:01:34,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:01:34,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:01:34,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:01:34,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:01:34,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:01:34,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:01:34,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:01:34,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:01:34,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:01:34,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:01:34,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:01:34,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:01:34,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:01:34,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:01:34,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:01:34,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:01:34,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:01:34,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:01:34,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:01:34,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:01:34,532 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:01:34,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:01:34,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:01:34,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:01:34,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:01:34,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:01:34,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:01:34,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:01:34,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:01:34,534 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:01:34,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:01:34,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:01:34,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:01:34,535 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:01:34,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:01:34,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:01:34,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:01:34,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:01:34,535 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:01:34,536 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:01:34,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:01:34,536 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:01:34,536 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:01:34,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:01:34,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:01:34,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:01:34,750 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:01:34,751 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:01:34,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/compact.c [2022-04-15 12:01:34,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a276b89/3b5eda237c944e94957c9cdc1b0b9770/FLAGae6bf114f [2022-04-15 12:01:35,166 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:01:35,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/compact.c [2022-04-15 12:01:35,170 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a276b89/3b5eda237c944e94957c9cdc1b0b9770/FLAGae6bf114f [2022-04-15 12:01:35,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a276b89/3b5eda237c944e94957c9cdc1b0b9770 [2022-04-15 12:01:35,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:01:35,184 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:01:35,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:01:35,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:01:35,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:01:35,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:01:35" (1/1) ... [2022-04-15 12:01:35,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb442a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:35, skipping insertion in model container [2022-04-15 12:01:35,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:01:35" (1/1) ... [2022-04-15 12:01:35,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:01:35,209 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:01:35,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/compact.c[609,622] [2022-04-15 12:01:35,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:01:35,354 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:01:35,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/compact.c[609,622] [2022-04-15 12:01:35,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:01:35,381 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:01:35,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:35 WrapperNode [2022-04-15 12:01:35,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:01:35,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:01:35,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:01:35,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:01:35,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:35" (1/1) ... [2022-04-15 12:01:35,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:35" (1/1) ... [2022-04-15 12:01:35,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:35" (1/1) ... [2022-04-15 12:01:35,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:35" (1/1) ... [2022-04-15 12:01:35,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:35" (1/1) ... [2022-04-15 12:01:35,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:35" (1/1) ... [2022-04-15 12:01:35,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:35" (1/1) ... [2022-04-15 12:01:35,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:01:35,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:01:35,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:01:35,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:01:35,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:35" (1/1) ... [2022-04-15 12:01:35,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:01:35,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:35,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:01:35,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:01:35,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:01:35,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:01:35,458 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:01:35,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:01:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:01:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:01:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:01:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:01:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 12:01:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:01:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:01:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:01:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:01:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:01:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:01:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:01:35,508 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:01:35,509 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:01:35,637 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:01:35,641 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:01:35,642 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 12:01:35,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:35 BoogieIcfgContainer [2022-04-15 12:01:35,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:01:35,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:01:35,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:01:35,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:01:35,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:01:35" (1/3) ... [2022-04-15 12:01:35,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9e0e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:35, skipping insertion in model container [2022-04-15 12:01:35,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:35" (2/3) ... [2022-04-15 12:01:35,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9e0e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:35, skipping insertion in model container [2022-04-15 12:01:35,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:35" (3/3) ... [2022-04-15 12:01:35,654 INFO L111 eAbstractionObserver]: Analyzing ICFG compact.c [2022-04-15 12:01:35,658 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:01:35,658 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:01:35,693 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:01:35,698 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:01:35,698 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:01:35,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:35,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-15 12:01:35,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:35,718 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:35,719 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:35,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:35,723 INFO L85 PathProgramCache]: Analyzing trace with hash 927625408, now seen corresponding path program 1 times [2022-04-15 12:01:35,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:35,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1958813206] [2022-04-15 12:01:35,739 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:01:35,739 INFO L85 PathProgramCache]: Analyzing trace with hash 927625408, now seen corresponding path program 2 times [2022-04-15 12:01:35,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:35,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594854962] [2022-04-15 12:01:35,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:35,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:35,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:35,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {21#true} is VALID [2022-04-15 12:01:35,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:01:35,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #43#return; {21#true} is VALID [2022-04-15 12:01:35,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:35,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {21#true} is VALID [2022-04-15 12:01:35,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:01:35,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #43#return; {21#true} is VALID [2022-04-15 12:01:35,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {21#true} is VALID [2022-04-15 12:01:35,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {21#true} is VALID [2022-04-15 12:01:36,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-15 12:01:36,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} ~i~0 := 0; {22#false} is VALID [2022-04-15 12:01:36,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume !true; {22#false} is VALID [2022-04-15 12:01:36,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-15 12:01:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:36,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:36,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594854962] [2022-04-15 12:01:36,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594854962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:36,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:36,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:01:36,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:36,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1958813206] [2022-04-15 12:01:36,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1958813206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:36,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:36,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:01:36,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873655333] [2022-04-15 12:01:36,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:36,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-15 12:01:36,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:36,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:36,042 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:01:36,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:36,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:01:36,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:01:36,070 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:36,221 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-04-15 12:01:36,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:01:36,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-15 12:01:36,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:36,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-15 12:01:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-15 12:01:36,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-15 12:01:36,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:36,325 INFO L225 Difference]: With dead ends: 37 [2022-04-15 12:01:36,325 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:01:36,328 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:01:36,333 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:36,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:01:36,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2022-04-15 12:01:36,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:36,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,365 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,366 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:36,371 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 12:01:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:01:36,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:36,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:36,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 12:01:36,372 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 12:01:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:36,373 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 12:01:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:01:36,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:36,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:36,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:36,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 12:01:36,379 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2022-04-15 12:01:36,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:36,379 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 12:01:36,380 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-15 12:01:36,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:36,399 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 12:01:36,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-15 12:01:36,400 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:36,400 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:36,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:01:36,402 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:36,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:36,406 INFO L85 PathProgramCache]: Analyzing trace with hash 927446352, now seen corresponding path program 1 times [2022-04-15 12:01:36,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:36,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [453452772] [2022-04-15 12:01:36,410 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:01:36,411 INFO L85 PathProgramCache]: Analyzing trace with hash 927446352, now seen corresponding path program 2 times [2022-04-15 12:01:36,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:36,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755530458] [2022-04-15 12:01:36,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:36,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:36,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:36,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {179#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {173#true} is VALID [2022-04-15 12:01:36,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-15 12:01:36,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173#true} {173#true} #43#return; {173#true} is VALID [2022-04-15 12:01:36,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {179#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:36,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {173#true} is VALID [2022-04-15 12:01:36,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-15 12:01:36,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} #43#return; {173#true} is VALID [2022-04-15 12:01:36,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {173#true} is VALID [2022-04-15 12:01:36,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {178#(= main_~i~0 0)} is VALID [2022-04-15 12:01:36,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#(= main_~i~0 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {174#false} is VALID [2022-04-15 12:01:36,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {174#false} ~i~0 := 0; {174#false} is VALID [2022-04-15 12:01:36,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {174#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {174#false} is VALID [2022-04-15 12:01:36,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#false} assume !false; {174#false} is VALID [2022-04-15 12:01:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:36,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:36,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755530458] [2022-04-15 12:01:36,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755530458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:36,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:36,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:36,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:36,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [453452772] [2022-04-15 12:01:36,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [453452772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:36,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:36,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:36,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268478878] [2022-04-15 12:01:36,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:36,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-15 12:01:36,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:36,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:36,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:01:36,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:36,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:01:36,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:01:36,548 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:36,624 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 12:01:36,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:01:36,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-15 12:01:36,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-15 12:01:36,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-15 12:01:36,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-15 12:01:36,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:36,659 INFO L225 Difference]: With dead ends: 25 [2022-04-15 12:01:36,660 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 12:01:36,660 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:01:36,663 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:36,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:36,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 12:01:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2022-04-15 12:01:36,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:36,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,677 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,677 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:36,678 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-15 12:01:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 12:01:36,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:36,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:36,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 12:01:36,679 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 12:01:36,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:36,680 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-15 12:01:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 12:01:36,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:36,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:36,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:36,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 12:01:36,681 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 10 [2022-04-15 12:01:36,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:36,681 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 12:01:36,682 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:36,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-15 12:01:36,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 12:01:36,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:01:36,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:36,706 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:36,706 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:01:36,707 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:36,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:36,707 INFO L85 PathProgramCache]: Analyzing trace with hash 706936613, now seen corresponding path program 1 times [2022-04-15 12:01:36,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:36,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1268864020] [2022-04-15 12:01:36,721 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:36,722 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:36,722 INFO L85 PathProgramCache]: Analyzing trace with hash 706936613, now seen corresponding path program 2 times [2022-04-15 12:01:36,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:36,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31897209] [2022-04-15 12:01:36,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:36,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:36,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:36,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {311#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {304#true} is VALID [2022-04-15 12:01:36,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#true} assume true; {304#true} is VALID [2022-04-15 12:01:36,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {304#true} {304#true} #43#return; {304#true} is VALID [2022-04-15 12:01:36,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {311#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:36,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {304#true} is VALID [2022-04-15 12:01:36,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {304#true} assume true; {304#true} is VALID [2022-04-15 12:01:36,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {304#true} {304#true} #43#return; {304#true} is VALID [2022-04-15 12:01:36,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {304#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {304#true} is VALID [2022-04-15 12:01:36,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {304#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {309#(= main_~i~0 0)} is VALID [2022-04-15 12:01:36,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {309#(= main_~i~0 0)} is VALID [2022-04-15 12:01:36,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {310#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:36,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {305#false} is VALID [2022-04-15 12:01:36,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {305#false} ~i~0 := 0; {305#false} is VALID [2022-04-15 12:01:36,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {305#false} is VALID [2022-04-15 12:01:36,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {305#false} is VALID [2022-04-15 12:01:36,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {305#false} is VALID [2022-04-15 12:01:36,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {305#false} is VALID [2022-04-15 12:01:36,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {305#false} assume !false; {305#false} is VALID [2022-04-15 12:01:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:01:36,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:36,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31897209] [2022-04-15 12:01:36,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31897209] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:36,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801619030] [2022-04-15 12:01:36,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:36,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:36,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:36,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:36,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:01:36,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:01:36,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:36,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 12:01:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:37,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:37,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {304#true} is VALID [2022-04-15 12:01:37,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {304#true} is VALID [2022-04-15 12:01:37,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {304#true} assume true; {304#true} is VALID [2022-04-15 12:01:37,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {304#true} {304#true} #43#return; {304#true} is VALID [2022-04-15 12:01:37,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {304#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {304#true} is VALID [2022-04-15 12:01:37,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {304#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {309#(= main_~i~0 0)} is VALID [2022-04-15 12:01:37,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {309#(= main_~i~0 0)} is VALID [2022-04-15 12:01:37,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {336#(= main_~i~0 1)} is VALID [2022-04-15 12:01:37,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {336#(= main_~i~0 1)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {305#false} is VALID [2022-04-15 12:01:37,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {305#false} ~i~0 := 0; {305#false} is VALID [2022-04-15 12:01:37,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {305#false} is VALID [2022-04-15 12:01:37,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {305#false} is VALID [2022-04-15 12:01:37,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {305#false} is VALID [2022-04-15 12:01:37,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {305#false} is VALID [2022-04-15 12:01:37,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {305#false} assume !false; {305#false} is VALID [2022-04-15 12:01:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:01:37,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:37,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {305#false} assume !false; {305#false} is VALID [2022-04-15 12:01:37,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {305#false} is VALID [2022-04-15 12:01:37,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {305#false} is VALID [2022-04-15 12:01:37,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {305#false} is VALID [2022-04-15 12:01:37,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {305#false} is VALID [2022-04-15 12:01:37,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {305#false} ~i~0 := 0; {305#false} is VALID [2022-04-15 12:01:37,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {305#false} is VALID [2022-04-15 12:01:37,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {380#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {376#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:01:37,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {380#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {380#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:37,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {304#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {380#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:37,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {304#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {304#true} is VALID [2022-04-15 12:01:37,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {304#true} {304#true} #43#return; {304#true} is VALID [2022-04-15 12:01:37,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {304#true} assume true; {304#true} is VALID [2022-04-15 12:01:37,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {304#true} is VALID [2022-04-15 12:01:37,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {304#true} is VALID [2022-04-15 12:01:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:01:37,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801619030] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:37,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:37,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 12:01:37,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:37,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1268864020] [2022-04-15 12:01:37,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1268864020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:37,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:37,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:01:37,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748333153] [2022-04-15 12:01:37,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:37,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:01:37,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:37,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:37,209 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:01:37,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:37,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:01:37,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:01:37,212 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:37,349 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-15 12:01:37,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:01:37,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:01:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-15 12:01:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-15 12:01:37,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-15 12:01:37,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:37,386 INFO L225 Difference]: With dead ends: 31 [2022-04-15 12:01:37,386 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 12:01:37,387 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:01:37,393 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:37,395 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:37,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 12:01:37,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-04-15 12:01:37,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:37,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,403 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,403 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:37,404 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-04-15 12:01:37,404 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-15 12:01:37,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:37,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:37,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 12:01:37,405 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 12:01:37,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:37,405 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-04-15 12:01:37,405 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-15 12:01:37,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:37,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:37,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:37,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:37,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-15 12:01:37,407 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2022-04-15 12:01:37,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:37,407 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-15 12:01:37,407 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:37,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-15 12:01:37,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-15 12:01:37,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:01:37,428 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:37,428 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:37,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:37,645 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:37,645 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:37,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:37,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1962996172, now seen corresponding path program 3 times [2022-04-15 12:01:37,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:37,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1837879525] [2022-04-15 12:01:37,654 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:37,654 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:37,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1962996172, now seen corresponding path program 4 times [2022-04-15 12:01:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:37,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121302489] [2022-04-15 12:01:37,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:37,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:37,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {566#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {558#true} is VALID [2022-04-15 12:01:37,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-15 12:01:37,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {558#true} {558#true} #43#return; {558#true} is VALID [2022-04-15 12:01:37,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {558#true} call ULTIMATE.init(); {566#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:37,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {566#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {558#true} is VALID [2022-04-15 12:01:37,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-15 12:01:37,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {558#true} {558#true} #43#return; {558#true} is VALID [2022-04-15 12:01:37,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {558#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {558#true} is VALID [2022-04-15 12:01:37,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {558#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {563#(= main_~i~0 0)} is VALID [2022-04-15 12:01:37,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {563#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {563#(= main_~i~0 0)} is VALID [2022-04-15 12:01:37,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:37,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:37,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {565#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:37,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {565#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {559#false} is VALID [2022-04-15 12:01:37,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {559#false} ~i~0 := 0; {559#false} is VALID [2022-04-15 12:01:37,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {559#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {559#false} is VALID [2022-04-15 12:01:37,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {559#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {559#false} is VALID [2022-04-15 12:01:37,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {559#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {559#false} is VALID [2022-04-15 12:01:37,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {559#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {559#false} is VALID [2022-04-15 12:01:37,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {559#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {559#false} is VALID [2022-04-15 12:01:37,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {559#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {559#false} is VALID [2022-04-15 12:01:37,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {559#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {559#false} is VALID [2022-04-15 12:01:37,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {559#false} assume !false; {559#false} is VALID [2022-04-15 12:01:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 12:01:37,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:37,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121302489] [2022-04-15 12:01:37,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121302489] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:37,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638576001] [2022-04-15 12:01:37,752 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:01:37,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:37,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:37,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:37,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 12:01:37,834 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:01:37,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:37,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 12:01:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:37,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:38,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {558#true} call ULTIMATE.init(); {558#true} is VALID [2022-04-15 12:01:38,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {558#true} is VALID [2022-04-15 12:01:38,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-15 12:01:38,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {558#true} {558#true} #43#return; {558#true} is VALID [2022-04-15 12:01:38,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {558#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {558#true} is VALID [2022-04-15 12:01:38,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {558#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {558#true} is VALID [2022-04-15 12:01:38,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {558#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {558#true} is VALID [2022-04-15 12:01:38,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {558#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {558#true} is VALID [2022-04-15 12:01:38,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {558#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {558#true} is VALID [2022-04-15 12:01:38,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {558#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {558#true} is VALID [2022-04-15 12:01:38,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {558#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {558#true} is VALID [2022-04-15 12:01:38,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {558#true} ~i~0 := 0; {563#(= main_~i~0 0)} is VALID [2022-04-15 12:01:38,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {563#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {563#(= main_~i~0 0)} is VALID [2022-04-15 12:01:38,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {563#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {563#(= main_~i~0 0)} is VALID [2022-04-15 12:01:38,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {563#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:38,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:38,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:38,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {564#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {621#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:38,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {621#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {559#false} is VALID [2022-04-15 12:01:38,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {559#false} assume !false; {559#false} is VALID [2022-04-15 12:01:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:01:38,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:38,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {559#false} assume !false; {559#false} is VALID [2022-04-15 12:01:38,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {631#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {559#false} is VALID [2022-04-15 12:01:38,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {635#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {631#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:01:38,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {635#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {635#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:38,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {635#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {635#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:38,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {645#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {635#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:38,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {645#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {645#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:38,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {645#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {645#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:38,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {558#true} ~i~0 := 0; {645#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:38,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {558#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {558#true} is VALID [2022-04-15 12:01:38,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {558#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {558#true} is VALID [2022-04-15 12:01:38,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {558#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {558#true} is VALID [2022-04-15 12:01:38,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {558#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {558#true} is VALID [2022-04-15 12:01:38,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {558#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {558#true} is VALID [2022-04-15 12:01:38,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {558#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {558#true} is VALID [2022-04-15 12:01:38,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {558#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {558#true} is VALID [2022-04-15 12:01:38,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {558#true} {558#true} #43#return; {558#true} is VALID [2022-04-15 12:01:38,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-15 12:01:38,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {558#true} is VALID [2022-04-15 12:01:38,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {558#true} call ULTIMATE.init(); {558#true} is VALID [2022-04-15 12:01:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:01:38,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638576001] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:38,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:38,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 12:01:38,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:38,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1837879525] [2022-04-15 12:01:38,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1837879525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:38,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:38,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:01:38,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751868108] [2022-04-15 12:01:38,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:38,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:01:38,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:38,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:38,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:01:38,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:38,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:01:38,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:01:38,278 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:38,394 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 12:01:38,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:01:38,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:01:38,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-15 12:01:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-15 12:01:38,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-04-15 12:01:38,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:38,437 INFO L225 Difference]: With dead ends: 39 [2022-04-15 12:01:38,437 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:01:38,438 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:01:38,439 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:38,440 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 21 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:01:38,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-04-15 12:01:38,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:38,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,458 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,459 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:38,462 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 12:01:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 12:01:38,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:38,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:38,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:01:38,464 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:01:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:38,472 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 12:01:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 12:01:38,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:38,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:38,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:38,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-15 12:01:38,473 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2022-04-15 12:01:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:38,474 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-15 12:01:38,474 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:38,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 27 transitions. [2022-04-15 12:01:38,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-15 12:01:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:01:38,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:38,506 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:38,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:38,730 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 12:01:38,730 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:38,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:38,730 INFO L85 PathProgramCache]: Analyzing trace with hash -436810175, now seen corresponding path program 5 times [2022-04-15 12:01:38,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:38,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1779428166] [2022-04-15 12:01:38,741 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:38,741 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash -436810175, now seen corresponding path program 6 times [2022-04-15 12:01:38,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:38,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646287365] [2022-04-15 12:01:38,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:38,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:38,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:38,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {889#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {880#true} is VALID [2022-04-15 12:01:38,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-15 12:01:38,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {880#true} {880#true} #43#return; {880#true} is VALID [2022-04-15 12:01:38,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {889#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:38,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {889#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {880#true} is VALID [2022-04-15 12:01:38,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-15 12:01:38,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} #43#return; {880#true} is VALID [2022-04-15 12:01:38,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {880#true} is VALID [2022-04-15 12:01:38,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {885#(= main_~i~0 0)} is VALID [2022-04-15 12:01:38,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {885#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {885#(= main_~i~0 0)} is VALID [2022-04-15 12:01:38,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {885#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:38,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:38,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:38,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:38,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {888#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:38,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {888#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 3))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {881#false} is VALID [2022-04-15 12:01:38,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {881#false} ~i~0 := 0; {881#false} is VALID [2022-04-15 12:01:38,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {881#false} is VALID [2022-04-15 12:01:38,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-15 12:01:38,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-15 12:01:38,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {881#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {881#false} is VALID [2022-04-15 12:01:38,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-15 12:01:38,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-15 12:01:38,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {881#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {881#false} is VALID [2022-04-15 12:01:38,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {881#false} is VALID [2022-04-15 12:01:38,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {881#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {881#false} is VALID [2022-04-15 12:01:38,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {881#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {881#false} is VALID [2022-04-15 12:01:38,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-04-15 12:01:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 12:01:38,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:38,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646287365] [2022-04-15 12:01:38,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646287365] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:38,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512919922] [2022-04-15 12:01:38,889 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:01:38,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:38,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:38,899 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:38,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 12:01:38,972 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 12:01:38,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:38,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 12:01:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:38,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:39,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {880#true} is VALID [2022-04-15 12:01:39,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {880#true} is VALID [2022-04-15 12:01:39,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-15 12:01:39,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} #43#return; {880#true} is VALID [2022-04-15 12:01:39,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {880#true} is VALID [2022-04-15 12:01:39,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {880#true} is VALID [2022-04-15 12:01:39,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {880#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {880#true} is VALID [2022-04-15 12:01:39,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {880#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {880#true} is VALID [2022-04-15 12:01:39,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {880#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {880#true} is VALID [2022-04-15 12:01:39,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {880#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {880#true} is VALID [2022-04-15 12:01:39,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {880#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {880#true} is VALID [2022-04-15 12:01:39,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {880#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {880#true} is VALID [2022-04-15 12:01:39,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {880#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {880#true} is VALID [2022-04-15 12:01:39,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {880#true} ~i~0 := 0; {885#(= main_~i~0 0)} is VALID [2022-04-15 12:01:39,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {885#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {885#(= main_~i~0 0)} is VALID [2022-04-15 12:01:39,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {885#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {885#(= main_~i~0 0)} is VALID [2022-04-15 12:01:39,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {885#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:39,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:39,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:39,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {886#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:39,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:39,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:39,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {887#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {959#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:39,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {959#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {881#false} is VALID [2022-04-15 12:01:39,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-04-15 12:01:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:01:39,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:39,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-04-15 12:01:39,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {969#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {881#false} is VALID [2022-04-15 12:01:39,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {973#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {969#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:01:39,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {973#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {973#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:39,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {973#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {973#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:39,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {983#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {973#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:39,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {983#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {983#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:39,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {983#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {983#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:39,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {993#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {983#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:39,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {993#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {993#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:39,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {993#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {993#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:39,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {880#true} ~i~0 := 0; {993#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:39,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {880#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {880#true} is VALID [2022-04-15 12:01:39,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {880#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {880#true} is VALID [2022-04-15 12:01:39,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {880#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {880#true} is VALID [2022-04-15 12:01:39,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {880#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {880#true} is VALID [2022-04-15 12:01:39,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {880#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {880#true} is VALID [2022-04-15 12:01:39,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {880#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {880#true} is VALID [2022-04-15 12:01:39,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {880#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {880#true} is VALID [2022-04-15 12:01:39,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {880#true} is VALID [2022-04-15 12:01:39,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {880#true} is VALID [2022-04-15 12:01:39,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} #43#return; {880#true} is VALID [2022-04-15 12:01:39,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-15 12:01:39,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {880#true} is VALID [2022-04-15 12:01:39,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {880#true} is VALID [2022-04-15 12:01:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:01:39,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512919922] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:39,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:39,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 12:01:39,401 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:39,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1779428166] [2022-04-15 12:01:39,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1779428166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:39,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:39,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:01:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339352337] [2022-04-15 12:01:39,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 12:01:39,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:39,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:39,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:01:39,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:39,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:01:39,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:01:39,421 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:39,604 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-15 12:01:39,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:01:39,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 12:01:39,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:39,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 12:01:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 12:01:39,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-15 12:01:39,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:39,641 INFO L225 Difference]: With dead ends: 47 [2022-04-15 12:01:39,641 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 12:01:39,641 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:01:39,642 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:39,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 31 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:01:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 12:01:39,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-15 12:01:39,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:39,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,660 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,660 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:39,662 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-15 12:01:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-15 12:01:39,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:39,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:39,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 12:01:39,663 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 12:01:39,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:39,664 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-15 12:01:39,664 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-15 12:01:39,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:39,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:39,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:39,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:39,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-15 12:01:39,666 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2022-04-15 12:01:39,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:39,666 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-15 12:01:39,666 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:39,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2022-04-15 12:01:39,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-15 12:01:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:01:39,691 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:39,691 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:39,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 12:01:39,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:39,892 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:39,892 INFO L85 PathProgramCache]: Analyzing trace with hash 329033496, now seen corresponding path program 7 times [2022-04-15 12:01:39,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:39,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1086254584] [2022-04-15 12:01:39,901 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:39,901 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:39,901 INFO L85 PathProgramCache]: Analyzing trace with hash 329033496, now seen corresponding path program 8 times [2022-04-15 12:01:39,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:39,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584734597] [2022-04-15 12:01:39,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:39,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:40,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:40,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {1280#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1270#true} is VALID [2022-04-15 12:01:40,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-15 12:01:40,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1270#true} {1270#true} #43#return; {1270#true} is VALID [2022-04-15 12:01:40,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1280#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:40,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {1280#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1270#true} is VALID [2022-04-15 12:01:40,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-15 12:01:40,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1270#true} {1270#true} #43#return; {1270#true} is VALID [2022-04-15 12:01:40,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {1270#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1270#true} is VALID [2022-04-15 12:01:40,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {1270#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1275#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {1275#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1275#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {1275#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:40,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:40,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:40,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:40,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:40,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:40,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1279#(and (<= main_~i~0 4) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:40,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {1279#(and (<= main_~i~0 4) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {1271#false} is VALID [2022-04-15 12:01:40,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {1271#false} ~i~0 := 0; {1271#false} is VALID [2022-04-15 12:01:40,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {1271#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1271#false} is VALID [2022-04-15 12:01:40,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {1271#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1271#false} is VALID [2022-04-15 12:01:40,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {1271#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1271#false} is VALID [2022-04-15 12:01:40,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {1271#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1271#false} is VALID [2022-04-15 12:01:40,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {1271#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1271#false} is VALID [2022-04-15 12:01:40,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {1271#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1271#false} is VALID [2022-04-15 12:01:40,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {1271#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1271#false} is VALID [2022-04-15 12:01:40,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {1271#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1271#false} is VALID [2022-04-15 12:01:40,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {1271#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1271#false} is VALID [2022-04-15 12:01:40,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {1271#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1271#false} is VALID [2022-04-15 12:01:40,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {1271#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1271#false} is VALID [2022-04-15 12:01:40,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {1271#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1271#false} is VALID [2022-04-15 12:01:40,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {1271#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {1271#false} is VALID [2022-04-15 12:01:40,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2022-04-15 12:01:40,035 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-15 12:01:40,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:40,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584734597] [2022-04-15 12:01:40,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584734597] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:40,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718369808] [2022-04-15 12:01:40,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:40,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:40,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:40,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:40,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 12:01:40,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:01:40,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:40,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 12:01:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:40,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:40,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1270#true} is VALID [2022-04-15 12:01:40,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1270#true} is VALID [2022-04-15 12:01:40,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-15 12:01:40,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1270#true} {1270#true} #43#return; {1270#true} is VALID [2022-04-15 12:01:40,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {1270#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1270#true} is VALID [2022-04-15 12:01:40,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {1270#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1275#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {1275#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1275#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {1275#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:40,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:40,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:40,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:40,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:40,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:40,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-15 12:01:40,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {1270#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {1270#true} is VALID [2022-04-15 12:01:40,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {1270#true} ~i~0 := 0; {1275#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {1275#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1275#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {1275#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1275#(= main_~i~0 0)} is VALID [2022-04-15 12:01:40,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {1275#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:40,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:40,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:40,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {1276#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:40,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:40,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:40,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {1277#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:40,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:40,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:40,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {1278#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1365#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:40,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {1365#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {1271#false} is VALID [2022-04-15 12:01:40,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2022-04-15 12:01:40,499 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-15 12:01:40,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:40,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2022-04-15 12:01:40,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {1375#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {1271#false} is VALID [2022-04-15 12:01:40,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1375#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:01:40,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:40,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:40,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1379#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:40,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:40,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:40,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1389#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:40,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:40,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:40,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1399#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:40,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:40,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:40,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {1270#true} ~i~0 := 0; {1409#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:40,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {1270#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {1270#true} is VALID [2022-04-15 12:01:40,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-15 12:01:40,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-15 12:01:40,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-15 12:01:40,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-15 12:01:40,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-15 12:01:40,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-15 12:01:40,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {1270#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1270#true} is VALID [2022-04-15 12:01:40,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {1270#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1270#true} is VALID [2022-04-15 12:01:40,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {1270#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1270#true} is VALID [2022-04-15 12:01:40,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {1270#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1270#true} is VALID [2022-04-15 12:01:40,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1270#true} {1270#true} #43#return; {1270#true} is VALID [2022-04-15 12:01:40,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-15 12:01:40,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1270#true} is VALID [2022-04-15 12:01:40,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1270#true} is VALID [2022-04-15 12:01:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 12:01:40,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718369808] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:40,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:40,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 12:01:40,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:40,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1086254584] [2022-04-15 12:01:40,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1086254584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:40,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:40,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:01:40,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319056036] [2022-04-15 12:01:40,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:40,662 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 12:01:40,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:40,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:40,677 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:01:40,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:40,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:01:40,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:01:40,678 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:40,917 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-04-15 12:01:40,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:01:40,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 12:01:40,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-15 12:01:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-15 12:01:40,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 48 transitions. [2022-04-15 12:01:40,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:40,957 INFO L225 Difference]: With dead ends: 55 [2022-04-15 12:01:40,957 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:01:40,957 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:01:40,958 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:40,958 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:01:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:01:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-04-15 12:01:41,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:41,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:41,007 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:41,007 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:41,008 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-15 12:01:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-15 12:01:41,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:41,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:41,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:01:41,009 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:01:41,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:41,010 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-15 12:01:41,010 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-15 12:01:41,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:41,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:41,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:41,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-04-15 12:01:41,012 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2022-04-15 12:01:41,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:41,012 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-04-15 12:01:41,012 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:41,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 37 transitions. [2022-04-15 12:01:41,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-04-15 12:01:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:01:41,042 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:41,042 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:41,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:41,252 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:41,252 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:41,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:41,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1926970717, now seen corresponding path program 9 times [2022-04-15 12:01:41,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:41,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [392291424] [2022-04-15 12:01:41,258 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:41,258 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:41,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1926970717, now seen corresponding path program 10 times [2022-04-15 12:01:41,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:41,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385361797] [2022-04-15 12:01:41,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:41,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:41,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:41,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {1739#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1728#true} is VALID [2022-04-15 12:01:41,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {1728#true} assume true; {1728#true} is VALID [2022-04-15 12:01:41,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1728#true} {1728#true} #43#return; {1728#true} is VALID [2022-04-15 12:01:41,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {1728#true} call ULTIMATE.init(); {1739#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:41,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {1739#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1728#true} is VALID [2022-04-15 12:01:41,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {1728#true} assume true; {1728#true} is VALID [2022-04-15 12:01:41,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1728#true} {1728#true} #43#return; {1728#true} is VALID [2022-04-15 12:01:41,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {1728#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1728#true} is VALID [2022-04-15 12:01:41,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {1728#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:41,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {1733#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:41,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {1733#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:41,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:41,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:41,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:41,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:41,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:41,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:41,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:41,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1738#(and (<= main_~i~0 5) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:41,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {1738#(and (<= main_~i~0 5) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {1729#false} is VALID [2022-04-15 12:01:41,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {1729#false} ~i~0 := 0; {1729#false} is VALID [2022-04-15 12:01:41,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1729#false} is VALID [2022-04-15 12:01:41,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 12:01:41,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 12:01:41,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1729#false} is VALID [2022-04-15 12:01:41,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 12:01:41,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 12:01:41,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1729#false} is VALID [2022-04-15 12:01:41,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 12:01:41,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 12:01:41,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1729#false} is VALID [2022-04-15 12:01:41,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 12:01:41,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 12:01:41,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {1729#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1729#false} is VALID [2022-04-15 12:01:41,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {1729#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1729#false} is VALID [2022-04-15 12:01:41,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {1729#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1729#false} is VALID [2022-04-15 12:01:41,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {1729#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {1729#false} is VALID [2022-04-15 12:01:41,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {1729#false} assume !false; {1729#false} is VALID [2022-04-15 12:01:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-15 12:01:41,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:41,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385361797] [2022-04-15 12:01:41,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385361797] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:41,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407479449] [2022-04-15 12:01:41,401 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:01:41,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:41,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:41,402 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:41,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 12:01:41,453 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:01:41,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:41,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 12:01:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:41,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:41,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {1728#true} call ULTIMATE.init(); {1728#true} is VALID [2022-04-15 12:01:41,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {1728#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1728#true} is VALID [2022-04-15 12:01:41,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {1728#true} assume true; {1728#true} is VALID [2022-04-15 12:01:41,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1728#true} {1728#true} #43#return; {1728#true} is VALID [2022-04-15 12:01:41,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {1728#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1728#true} is VALID [2022-04-15 12:01:41,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {1728#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1728#true} is VALID [2022-04-15 12:01:41,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {1728#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1728#true} is VALID [2022-04-15 12:01:41,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {1728#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1728#true} is VALID [2022-04-15 12:01:41,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {1728#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1728#true} is VALID [2022-04-15 12:01:41,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {1728#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1728#true} is VALID [2022-04-15 12:01:41,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {1728#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1728#true} is VALID [2022-04-15 12:01:41,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {1728#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1728#true} is VALID [2022-04-15 12:01:41,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {1728#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1728#true} is VALID [2022-04-15 12:01:41,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {1728#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1728#true} is VALID [2022-04-15 12:01:41,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {1728#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1728#true} is VALID [2022-04-15 12:01:41,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {1728#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1728#true} is VALID [2022-04-15 12:01:41,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {1728#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {1728#true} is VALID [2022-04-15 12:01:41,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {1728#true} ~i~0 := 0; {1733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:41,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {1733#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:41,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {1733#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1733#(= main_~i~0 0)} is VALID [2022-04-15 12:01:41,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {1733#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:41,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:41,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:41,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {1734#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:41,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:41,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:41,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {1735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:41,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:41,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:41,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {1736#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:41,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:41,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:41,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {1737#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1839#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:41,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {1839#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {1729#false} is VALID [2022-04-15 12:01:41,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {1729#false} assume !false; {1729#false} is VALID [2022-04-15 12:01:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:01:41,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:41,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {1729#false} assume !false; {1729#false} is VALID [2022-04-15 12:01:41,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {1849#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {1729#false} is VALID [2022-04-15 12:01:41,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {1853#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1849#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:01:41,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {1853#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1853#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:41,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {1853#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1853#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:41,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {1863#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1853#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:41,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {1863#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1863#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:41,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {1863#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1863#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:41,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {1873#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1863#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:41,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {1873#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1873#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:41,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {1873#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1873#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:41,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {1883#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1873#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:41,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {1883#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1883#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:41,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {1883#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1883#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:41,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {1893#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1883#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:41,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {1893#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {1893#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:41,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {1893#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {1893#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:41,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {1728#true} ~i~0 := 0; {1893#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:41,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {1728#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {1728#true} is VALID [2022-04-15 12:01:41,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {1728#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1728#true} is VALID [2022-04-15 12:01:41,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {1728#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1728#true} is VALID [2022-04-15 12:01:41,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {1728#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1728#true} is VALID [2022-04-15 12:01:41,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {1728#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1728#true} is VALID [2022-04-15 12:01:41,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {1728#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1728#true} is VALID [2022-04-15 12:01:41,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {1728#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1728#true} is VALID [2022-04-15 12:01:41,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {1728#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1728#true} is VALID [2022-04-15 12:01:41,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {1728#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1728#true} is VALID [2022-04-15 12:01:41,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {1728#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1728#true} is VALID [2022-04-15 12:01:41,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {1728#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {1728#true} is VALID [2022-04-15 12:01:41,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {1728#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {1728#true} is VALID [2022-04-15 12:01:41,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {1728#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {1728#true} is VALID [2022-04-15 12:01:41,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1728#true} {1728#true} #43#return; {1728#true} is VALID [2022-04-15 12:01:41,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {1728#true} assume true; {1728#true} is VALID [2022-04-15 12:01:41,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {1728#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1728#true} is VALID [2022-04-15 12:01:41,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {1728#true} call ULTIMATE.init(); {1728#true} is VALID [2022-04-15 12:01:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:01:41,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407479449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:41,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:41,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-15 12:01:41,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:41,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [392291424] [2022-04-15 12:01:41,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [392291424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:41,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:41,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:01:41,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924484752] [2022-04-15 12:01:41,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:41,962 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 12:01:41,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:41,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:41,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:41,982 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:01:41,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:41,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:01:41,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:01:41,982 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:42,270 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-04-15 12:01:42,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:01:42,270 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 12:01:42,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-04-15 12:01:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-04-15 12:01:42,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2022-04-15 12:01:42,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:42,329 INFO L225 Difference]: With dead ends: 63 [2022-04-15 12:01:42,329 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 12:01:42,331 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:01:42,331 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:42,332 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 42 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:01:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 12:01:42,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2022-04-15 12:01:42,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:42,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,370 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,370 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:42,371 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-04-15 12:01:42,371 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2022-04-15 12:01:42,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:42,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:42,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 12:01:42,372 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 12:01:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:42,373 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-04-15 12:01:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2022-04-15 12:01:42,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:42,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:42,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:42,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2022-04-15 12:01:42,374 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2022-04-15 12:01:42,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:42,375 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2022-04-15 12:01:42,375 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 42 transitions. [2022-04-15 12:01:42,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:42,403 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 12:01:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 12:01:42,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:42,404 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:42,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:42,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:42,623 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:42,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:42,624 INFO L85 PathProgramCache]: Analyzing trace with hash 261275644, now seen corresponding path program 11 times [2022-04-15 12:01:42,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:42,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2111395229] [2022-04-15 12:01:42,628 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:42,628 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:42,629 INFO L85 PathProgramCache]: Analyzing trace with hash 261275644, now seen corresponding path program 12 times [2022-04-15 12:01:42,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:42,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333045632] [2022-04-15 12:01:42,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:42,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:42,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:42,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {2266#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2254#true} is VALID [2022-04-15 12:01:42,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-15 12:01:42,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2254#true} {2254#true} #43#return; {2254#true} is VALID [2022-04-15 12:01:42,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {2254#true} call ULTIMATE.init(); {2266#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:42,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {2266#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2254#true} is VALID [2022-04-15 12:01:42,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-15 12:01:42,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2254#true} {2254#true} #43#return; {2254#true} is VALID [2022-04-15 12:01:42,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {2254#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2254#true} is VALID [2022-04-15 12:01:42,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {2254#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {2259#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {2259#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2259#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {2259#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:42,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:42,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:42,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:42,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:42,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:42,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:42,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:42,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:42,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:42,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2265#(and (<= main_~i~0 6) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:42,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {2265#(and (<= main_~i~0 6) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {2255#false} is VALID [2022-04-15 12:01:42,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {2255#false} ~i~0 := 0; {2255#false} is VALID [2022-04-15 12:01:42,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:42,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:42,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:42,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:42,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:42,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:42,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:42,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:42,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:42,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:42,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:42,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:42,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:42,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:42,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:42,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:42,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:42,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:42,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {2255#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {2255#false} is VALID [2022-04-15 12:01:42,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {2255#false} assume !false; {2255#false} is VALID [2022-04-15 12:01:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-15 12:01:42,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:42,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333045632] [2022-04-15 12:01:42,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333045632] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:42,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928384024] [2022-04-15 12:01:42,792 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:01:42,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:42,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:42,793 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:42,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 12:01:43,117 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:01:43,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:43,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 12:01:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:43,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:43,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {2254#true} call ULTIMATE.init(); {2254#true} is VALID [2022-04-15 12:01:43,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {2254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2254#true} is VALID [2022-04-15 12:01:43,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-15 12:01:43,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2254#true} {2254#true} #43#return; {2254#true} is VALID [2022-04-15 12:01:43,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {2254#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2254#true} is VALID [2022-04-15 12:01:43,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {2254#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {2259#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {2259#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2259#(= main_~i~0 0)} is VALID [2022-04-15 12:01:43,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {2259#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:43,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:43,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {2260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:43,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:43,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {2261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:43,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:43,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {2262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:43,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:43,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {2263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:43,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:43,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {2264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2321#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:43,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {2321#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {2255#false} is VALID [2022-04-15 12:01:43,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {2255#false} ~i~0 := 0; {2255#false} is VALID [2022-04-15 12:01:43,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:43,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:43,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:43,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:43,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:43,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:43,454 INFO L290 TraceCheckUtils]: 26: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:43,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:43,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:43,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:43,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:43,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:43,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:43,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:43,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:43,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:43,455 INFO L290 TraceCheckUtils]: 36: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:43,455 INFO L290 TraceCheckUtils]: 37: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:43,455 INFO L290 TraceCheckUtils]: 38: Hoare triple {2255#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {2255#false} is VALID [2022-04-15 12:01:43,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {2255#false} assume !false; {2255#false} is VALID [2022-04-15 12:01:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-15 12:01:43,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:43,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {2255#false} assume !false; {2255#false} is VALID [2022-04-15 12:01:43,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {2255#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {2255#false} is VALID [2022-04-15 12:01:43,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:43,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:43,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:43,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:43,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:43,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:43,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:43,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:43,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:43,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:43,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:43,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:43,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:43,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:43,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:43,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {2255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2255#false} is VALID [2022-04-15 12:01:43,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {2255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2255#false} is VALID [2022-04-15 12:01:43,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {2255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2255#false} is VALID [2022-04-15 12:01:43,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {2255#false} ~i~0 := 0; {2255#false} is VALID [2022-04-15 12:01:43,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {2451#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {2255#false} is VALID [2022-04-15 12:01:43,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {2455#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2451#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:01:43,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {2455#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2455#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:43,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {2462#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2455#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:43,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {2462#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2462#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:43,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {2469#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2462#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:43,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {2469#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2469#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:43,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {2476#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2469#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:43,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {2476#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2476#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:43,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {2483#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2476#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:43,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {2483#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2483#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:43,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {2490#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2483#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:43,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {2490#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2490#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:01:43,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {2254#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;assume -128 <= #t~nondet4 && #t~nondet4 <= 127;~ND~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;~i~0 := 0; {2490#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:01:43,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {2254#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2254#true} is VALID [2022-04-15 12:01:43,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2254#true} {2254#true} #43#return; {2254#true} is VALID [2022-04-15 12:01:43,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {2254#true} assume true; {2254#true} is VALID [2022-04-15 12:01:43,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {2254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(102400, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2254#true} is VALID [2022-04-15 12:01:43,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {2254#true} call ULTIMATE.init(); {2254#true} is VALID [2022-04-15 12:01:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-15 12:01:43,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928384024] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:43,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:43,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-15 12:01:43,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:43,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2111395229] [2022-04-15 12:01:43,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2111395229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:43,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:43,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:01:43,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847929331] [2022-04-15 12:01:43,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:43,645 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 12:01:43,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:43,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:43,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:01:43,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:43,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:01:43,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:01:43,665 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:44,041 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-15 12:01:44,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:01:44,042 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 12:01:44,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-15 12:01:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-15 12:01:44,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-15 12:01:44,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:44,081 INFO L225 Difference]: With dead ends: 71 [2022-04-15 12:01:44,082 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 12:01:44,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:01:44,082 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:44,083 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 73 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:01:44,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 12:01:44,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2022-04-15 12:01:44,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:44,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,112 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,113 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:44,114 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-04-15 12:01:44,114 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-15 12:01:44,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:44,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:44,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 12:01:44,114 INFO L87 Difference]: Start difference. First operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 12:01:44,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:44,115 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-04-15 12:01:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-15 12:01:44,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:44,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:44,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:44,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2022-04-15 12:01:44,116 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2022-04-15 12:01:44,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:44,116 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2022-04-15 12:01:44,117 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 47 transitions. [2022-04-15 12:01:44,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2022-04-15 12:01:44,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 12:01:44,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:44,148 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:44,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:44,353 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:44,353 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:44,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1323430791, now seen corresponding path program 13 times [2022-04-15 12:01:44,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:44,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1364048191] [2022-04-15 12:01:44,388 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:44,388 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:44,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1323430791, now seen corresponding path program 14 times [2022-04-15 12:01:44,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:44,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446832258] [2022-04-15 12:01:44,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:44,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:44,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:44,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {2861#(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); {2848#true} is VALID [2022-04-15 12:01:44,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {2848#true} assume true; {2848#true} is VALID [2022-04-15 12:01:44,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2848#true} {2848#true} #43#return; {2848#true} is VALID [2022-04-15 12:01:44,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {2848#true} call ULTIMATE.init(); {2861#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:44,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {2861#(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); {2848#true} is VALID [2022-04-15 12:01:44,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {2848#true} assume true; {2848#true} is VALID [2022-04-15 12:01:44,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2848#true} {2848#true} #43#return; {2848#true} is VALID [2022-04-15 12:01:44,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {2848#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2848#true} is VALID [2022-04-15 12:01:44,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {2848#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; {2853#(= main_~i~0 0)} is VALID [2022-04-15 12:01:44,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {2853#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2853#(= main_~i~0 0)} is VALID [2022-04-15 12:01:44,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {2853#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2854#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:44,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {2854#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2854#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:44,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {2854#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2855#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:44,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {2855#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2855#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:44,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {2855#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2856#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:44,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {2856#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2856#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:44,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {2856#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2857#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:44,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {2857#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2857#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:44,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {2857#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2858#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:44,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {2858#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2858#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:44,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {2858#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2859#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:44,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {2859#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2859#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:44,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {2859#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2860#(and (<= main_~i~0 7) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:44,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {2860#(and (<= main_~i~0 7) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {2849#false} is VALID [2022-04-15 12:01:44,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {2849#false} ~i~0 := 0; {2849#false} is VALID [2022-04-15 12:01:44,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:44,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:44,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:44,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:44,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:44,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:44,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:44,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:44,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:44,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:44,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:44,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:44,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:44,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:44,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:44,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:44,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:44,533 INFO L290 TraceCheckUtils]: 39: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:44,533 INFO L290 TraceCheckUtils]: 40: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:44,533 INFO L290 TraceCheckUtils]: 41: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:44,533 INFO L290 TraceCheckUtils]: 42: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:44,533 INFO L290 TraceCheckUtils]: 43: Hoare triple {2849#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {2849#false} is VALID [2022-04-15 12:01:44,533 INFO L290 TraceCheckUtils]: 44: Hoare triple {2849#false} assume !false; {2849#false} is VALID [2022-04-15 12:01:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-15 12:01:44,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:44,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446832258] [2022-04-15 12:01:44,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446832258] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:44,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909259183] [2022-04-15 12:01:44,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:44,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:44,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:44,535 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:44,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 12:01:44,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:01:44,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:44,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 12:01:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:44,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:44,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {2848#true} call ULTIMATE.init(); {2848#true} is VALID [2022-04-15 12:01:44,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {2848#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); {2848#true} is VALID [2022-04-15 12:01:44,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {2848#true} assume true; {2848#true} is VALID [2022-04-15 12:01:44,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2848#true} {2848#true} #43#return; {2848#true} is VALID [2022-04-15 12:01:44,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {2848#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2848#true} is VALID [2022-04-15 12:01:44,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {2848#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; {2853#(= main_~i~0 0)} is VALID [2022-04-15 12:01:44,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {2853#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2853#(= main_~i~0 0)} is VALID [2022-04-15 12:01:44,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {2853#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2854#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:44,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {2854#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2854#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:44,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {2854#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2855#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:44,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {2855#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2855#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:44,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {2855#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2856#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:44,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {2856#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2856#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:44,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {2856#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2857#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:44,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {2857#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2857#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:44,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {2857#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2858#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:44,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {2858#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2858#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:44,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {2858#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2859#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:44,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {2859#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {2859#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:44,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {2859#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2922#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:44,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {2922#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {2849#false} is VALID [2022-04-15 12:01:44,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {2849#false} ~i~0 := 0; {2849#false} is VALID [2022-04-15 12:01:44,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:44,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:44,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:44,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:44,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:44,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:44,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:44,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:44,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:44,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:44,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:44,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:44,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:44,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:44,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:44,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:44,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:44,916 INFO L290 TraceCheckUtils]: 39: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:44,916 INFO L290 TraceCheckUtils]: 40: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:44,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:44,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:44,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {2849#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {2849#false} is VALID [2022-04-15 12:01:44,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {2849#false} assume !false; {2849#false} is VALID [2022-04-15 12:01:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-15 12:01:44,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:45,154 INFO L290 TraceCheckUtils]: 44: Hoare triple {2849#false} assume !false; {2849#false} is VALID [2022-04-15 12:01:45,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {2849#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {2849#false} is VALID [2022-04-15 12:01:45,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:45,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:45,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:45,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:45,154 INFO L290 TraceCheckUtils]: 38: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:45,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:45,155 INFO L290 TraceCheckUtils]: 36: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:45,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:45,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:45,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:45,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:45,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:45,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:45,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:45,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:45,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:45,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:45,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:45,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {2849#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2849#false} is VALID [2022-04-15 12:01:45,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {2849#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {2849#false} is VALID [2022-04-15 12:01:45,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {2849#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {2849#false} is VALID [2022-04-15 12:01:45,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {2849#false} ~i~0 := 0; {2849#false} is VALID [2022-04-15 12:01:45,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {3070#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {2849#false} is VALID [2022-04-15 12:01:45,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {3074#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3070#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:01:45,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {3074#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3074#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:45,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {3081#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3074#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:45,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {3081#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3081#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:45,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {3088#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3081#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:45,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {3088#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3088#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:45,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {3095#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3088#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:45,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {3095#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3095#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:45,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {3102#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3095#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:45,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {3102#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3102#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:45,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {3109#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3102#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:45,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {3109#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3109#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:01:45,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {3116#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3109#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:01:45,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {3116#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3116#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:45,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {2848#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; {3116#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:45,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {2848#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {2848#true} is VALID [2022-04-15 12:01:45,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2848#true} {2848#true} #43#return; {2848#true} is VALID [2022-04-15 12:01:45,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {2848#true} assume true; {2848#true} is VALID [2022-04-15 12:01:45,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {2848#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); {2848#true} is VALID [2022-04-15 12:01:45,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {2848#true} call ULTIMATE.init(); {2848#true} is VALID [2022-04-15 12:01:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-15 12:01:45,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909259183] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:45,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:45,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-15 12:01:45,164 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:45,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1364048191] [2022-04-15 12:01:45,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1364048191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:45,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:45,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:01:45,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052659469] [2022-04-15 12:01:45,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:45,165 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 12:01:45,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:45,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:45,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:01:45,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:45,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:01:45,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:01:45,186 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:45,669 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-04-15 12:01:45,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:01:45,669 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 12:01:45,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2022-04-15 12:01:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2022-04-15 12:01:45,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 63 transitions. [2022-04-15 12:01:45,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:45,713 INFO L225 Difference]: With dead ends: 79 [2022-04-15 12:01:45,713 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 12:01:45,714 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:01:45,714 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:45,714 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 86 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:01:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 12:01:45,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2022-04-15 12:01:45,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:45,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,750 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,750 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:45,751 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-04-15 12:01:45,752 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-04-15 12:01:45,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:45,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:45,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 12:01:45,752 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 12:01:45,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:45,753 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-04-15 12:01:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-04-15 12:01:45,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:45,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:45,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:45,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:45,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-04-15 12:01:45,754 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 45 [2022-04-15 12:01:45,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:45,754 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-04-15 12:01:45,755 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:45,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 52 transitions. [2022-04-15 12:01:45,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:45,798 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-04-15 12:01:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 12:01:45,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:45,799 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:45,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:46,009 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:46,009 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:46,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:46,010 INFO L85 PathProgramCache]: Analyzing trace with hash 416520416, now seen corresponding path program 15 times [2022-04-15 12:01:46,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:46,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [87446005] [2022-04-15 12:01:46,016 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:46,016 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash 416520416, now seen corresponding path program 16 times [2022-04-15 12:01:46,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:46,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560603804] [2022-04-15 12:01:46,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:46,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:46,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:46,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {3524#(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); {3510#true} is VALID [2022-04-15 12:01:46,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {3510#true} assume true; {3510#true} is VALID [2022-04-15 12:01:46,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3510#true} {3510#true} #43#return; {3510#true} is VALID [2022-04-15 12:01:46,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {3510#true} call ULTIMATE.init(); {3524#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:46,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {3524#(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); {3510#true} is VALID [2022-04-15 12:01:46,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {3510#true} assume true; {3510#true} is VALID [2022-04-15 12:01:46,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3510#true} {3510#true} #43#return; {3510#true} is VALID [2022-04-15 12:01:46,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {3510#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {3510#true} is VALID [2022-04-15 12:01:46,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {3510#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; {3515#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {3515#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3515#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {3515#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3516#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:46,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {3516#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3516#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:46,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {3516#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3517#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:46,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {3517#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3517#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:46,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {3517#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3518#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:46,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {3518#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3518#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:46,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {3518#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3519#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:46,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {3519#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3519#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:46,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {3519#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3520#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:46,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {3520#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3520#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:46,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {3520#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3521#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:46,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {3521#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3521#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:46,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {3521#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3522#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:46,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {3522#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3522#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:46,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {3522#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3523#(and (<= main_~i~0 8) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:46,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {3523#(and (<= main_~i~0 8) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {3511#false} is VALID [2022-04-15 12:01:46,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {3511#false} ~i~0 := 0; {3511#false} is VALID [2022-04-15 12:01:46,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {3511#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3511#false} is VALID [2022-04-15 12:01:46,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {3511#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3511#false} is VALID [2022-04-15 12:01:46,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {3511#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3511#false} is VALID [2022-04-15 12:01:46,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {3511#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3511#false} is VALID [2022-04-15 12:01:46,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {3511#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3511#false} is VALID [2022-04-15 12:01:46,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {3511#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3511#false} is VALID [2022-04-15 12:01:46,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {3511#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3511#false} is VALID [2022-04-15 12:01:46,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {3511#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3511#false} is VALID [2022-04-15 12:01:46,244 INFO L290 TraceCheckUtils]: 32: Hoare triple {3511#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3511#false} is VALID [2022-04-15 12:01:46,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {3511#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3511#false} is VALID [2022-04-15 12:01:46,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {3511#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3511#false} is VALID [2022-04-15 12:01:46,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {3511#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3511#false} is VALID [2022-04-15 12:01:46,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {3511#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3511#false} is VALID [2022-04-15 12:01:46,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {3511#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3511#false} is VALID [2022-04-15 12:01:46,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {3511#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3511#false} is VALID [2022-04-15 12:01:46,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {3511#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3511#false} is VALID [2022-04-15 12:01:46,245 INFO L290 TraceCheckUtils]: 40: Hoare triple {3511#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3511#false} is VALID [2022-04-15 12:01:46,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {3511#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3511#false} is VALID [2022-04-15 12:01:46,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {3511#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3511#false} is VALID [2022-04-15 12:01:46,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {3511#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3511#false} is VALID [2022-04-15 12:01:46,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {3511#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3511#false} is VALID [2022-04-15 12:01:46,245 INFO L290 TraceCheckUtils]: 45: Hoare triple {3511#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3511#false} is VALID [2022-04-15 12:01:46,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {3511#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3511#false} is VALID [2022-04-15 12:01:46,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {3511#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3511#false} is VALID [2022-04-15 12:01:46,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {3511#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {3511#false} is VALID [2022-04-15 12:01:46,246 INFO L290 TraceCheckUtils]: 49: Hoare triple {3511#false} assume !false; {3511#false} is VALID [2022-04-15 12:01:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-15 12:01:46,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:46,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560603804] [2022-04-15 12:01:46,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560603804] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:46,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522286177] [2022-04-15 12:01:46,246 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:01:46,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:46,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:46,249 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:46,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 12:01:46,429 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:01:46,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:46,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 12:01:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:46,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:46,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {3510#true} call ULTIMATE.init(); {3510#true} is VALID [2022-04-15 12:01:46,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {3510#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); {3510#true} is VALID [2022-04-15 12:01:46,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {3510#true} assume true; {3510#true} is VALID [2022-04-15 12:01:46,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3510#true} {3510#true} #43#return; {3510#true} is VALID [2022-04-15 12:01:46,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {3510#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {3510#true} is VALID [2022-04-15 12:01:46,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {3510#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; {3510#true} is VALID [2022-04-15 12:01:46,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {3510#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3510#true} is VALID [2022-04-15 12:01:46,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {3510#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3510#true} is VALID [2022-04-15 12:01:46,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {3510#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3510#true} is VALID [2022-04-15 12:01:46,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {3510#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3510#true} is VALID [2022-04-15 12:01:46,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {3510#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3510#true} is VALID [2022-04-15 12:01:46,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {3510#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3510#true} is VALID [2022-04-15 12:01:46,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {3510#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3510#true} is VALID [2022-04-15 12:01:46,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {3510#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3510#true} is VALID [2022-04-15 12:01:46,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {3510#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3510#true} is VALID [2022-04-15 12:01:46,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {3510#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3510#true} is VALID [2022-04-15 12:01:46,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {3510#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3510#true} is VALID [2022-04-15 12:01:46,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {3510#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3510#true} is VALID [2022-04-15 12:01:46,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {3510#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3510#true} is VALID [2022-04-15 12:01:46,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {3510#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3510#true} is VALID [2022-04-15 12:01:46,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {3510#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3510#true} is VALID [2022-04-15 12:01:46,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {3510#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3510#true} is VALID [2022-04-15 12:01:46,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {3510#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {3510#true} is VALID [2022-04-15 12:01:46,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {3510#true} ~i~0 := 0; {3515#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {3515#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3515#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {3515#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3515#(= main_~i~0 0)} is VALID [2022-04-15 12:01:46,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {3515#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3516#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:46,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {3516#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3516#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:46,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {3516#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3516#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:46,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {3516#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3517#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:46,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {3517#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3517#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:46,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {3517#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3517#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:46,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {3517#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3518#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:46,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {3518#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3518#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:46,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {3518#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3518#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:46,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {3518#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3519#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:46,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {3519#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3519#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:46,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {3519#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3519#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:46,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {3519#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3520#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:46,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {3520#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3520#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:46,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {3520#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3520#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:46,813 INFO L290 TraceCheckUtils]: 41: Hoare triple {3520#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3521#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:46,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {3521#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3521#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:46,814 INFO L290 TraceCheckUtils]: 43: Hoare triple {3521#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3521#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:46,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {3521#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3522#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:46,814 INFO L290 TraceCheckUtils]: 45: Hoare triple {3522#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3522#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:46,815 INFO L290 TraceCheckUtils]: 46: Hoare triple {3522#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3522#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:46,815 INFO L290 TraceCheckUtils]: 47: Hoare triple {3522#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3669#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:46,816 INFO L290 TraceCheckUtils]: 48: Hoare triple {3669#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {3511#false} is VALID [2022-04-15 12:01:46,816 INFO L290 TraceCheckUtils]: 49: Hoare triple {3511#false} assume !false; {3511#false} is VALID [2022-04-15 12:01:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 12:01:46,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:47,095 INFO L290 TraceCheckUtils]: 49: Hoare triple {3511#false} assume !false; {3511#false} is VALID [2022-04-15 12:01:47,096 INFO L290 TraceCheckUtils]: 48: Hoare triple {3679#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {3511#false} is VALID [2022-04-15 12:01:47,096 INFO L290 TraceCheckUtils]: 47: Hoare triple {3683#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3679#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:01:47,097 INFO L290 TraceCheckUtils]: 46: Hoare triple {3683#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3683#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {3683#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3683#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {3693#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3683#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,098 INFO L290 TraceCheckUtils]: 43: Hoare triple {3693#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3693#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,098 INFO L290 TraceCheckUtils]: 42: Hoare triple {3693#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3693#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,098 INFO L290 TraceCheckUtils]: 41: Hoare triple {3703#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3693#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {3703#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3703#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,099 INFO L290 TraceCheckUtils]: 39: Hoare triple {3703#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3703#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {3713#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3703#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {3713#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3713#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {3713#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3713#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {3723#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3713#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {3723#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3723#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {3723#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3723#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {3733#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3723#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {3733#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3733#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {3733#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3733#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {3743#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3733#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {3743#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3743#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {3743#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3743#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {3753#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3743#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {3753#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {3753#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {3753#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {3753#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {3510#true} ~i~0 := 0; {3753#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:01:47,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {3510#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {3510#true} is VALID [2022-04-15 12:01:47,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {3510#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3510#true} is VALID [2022-04-15 12:01:47,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {3510#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3510#true} is VALID [2022-04-15 12:01:47,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {3510#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3510#true} is VALID [2022-04-15 12:01:47,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {3510#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3510#true} is VALID [2022-04-15 12:01:47,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {3510#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3510#true} is VALID [2022-04-15 12:01:47,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {3510#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3510#true} is VALID [2022-04-15 12:01:47,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {3510#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3510#true} is VALID [2022-04-15 12:01:47,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {3510#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3510#true} is VALID [2022-04-15 12:01:47,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {3510#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3510#true} is VALID [2022-04-15 12:01:47,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {3510#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3510#true} is VALID [2022-04-15 12:01:47,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {3510#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3510#true} is VALID [2022-04-15 12:01:47,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {3510#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3510#true} is VALID [2022-04-15 12:01:47,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {3510#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3510#true} is VALID [2022-04-15 12:01:47,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {3510#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3510#true} is VALID [2022-04-15 12:01:47,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {3510#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3510#true} is VALID [2022-04-15 12:01:47,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {3510#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {3510#true} is VALID [2022-04-15 12:01:47,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {3510#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; {3510#true} is VALID [2022-04-15 12:01:47,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {3510#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {3510#true} is VALID [2022-04-15 12:01:47,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3510#true} {3510#true} #43#return; {3510#true} is VALID [2022-04-15 12:01:47,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {3510#true} assume true; {3510#true} is VALID [2022-04-15 12:01:47,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {3510#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); {3510#true} is VALID [2022-04-15 12:01:47,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {3510#true} call ULTIMATE.init(); {3510#true} is VALID [2022-04-15 12:01:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 12:01:47,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522286177] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:47,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:47,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-15 12:01:47,108 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:47,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [87446005] [2022-04-15 12:01:47,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [87446005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:47,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:47,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:01:47,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672210644] [2022-04-15 12:01:47,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:47,109 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 12:01:47,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:47,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:47,129 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:01:47,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:47,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:01:47,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:01:47,132 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:47,747 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-04-15 12:01:47,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:01:47,747 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 12:01:47,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-04-15 12:01:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-04-15 12:01:47,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 68 transitions. [2022-04-15 12:01:47,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:47,803 INFO L225 Difference]: With dead ends: 87 [2022-04-15 12:01:47,803 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 12:01:47,804 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:01:47,804 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 43 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:47,804 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 81 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:01:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 12:01:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-04-15 12:01:47,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:47,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,851 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,852 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:47,853 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-04-15 12:01:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-15 12:01:47,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:47,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:47,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 12:01:47,853 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 12:01:47,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:47,854 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-04-15 12:01:47,854 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-15 12:01:47,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:47,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:47,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:47,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2022-04-15 12:01:47,855 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2022-04-15 12:01:47,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:47,855 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2022-04-15 12:01:47,856 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:47,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 57 transitions. [2022-04-15 12:01:47,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-04-15 12:01:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 12:01:47,901 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:47,901 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:47,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:48,101 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 12:01:48,102 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:48,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:48,102 INFO L85 PathProgramCache]: Analyzing trace with hash -208864363, now seen corresponding path program 17 times [2022-04-15 12:01:48,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:48,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [274955817] [2022-04-15 12:01:48,109 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:48,109 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:48,109 INFO L85 PathProgramCache]: Analyzing trace with hash -208864363, now seen corresponding path program 18 times [2022-04-15 12:01:48,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:48,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249834576] [2022-04-15 12:01:48,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:48,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:48,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:48,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {4255#(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); {4240#true} is VALID [2022-04-15 12:01:48,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {4240#true} assume true; {4240#true} is VALID [2022-04-15 12:01:48,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4240#true} {4240#true} #43#return; {4240#true} is VALID [2022-04-15 12:01:48,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {4240#true} call ULTIMATE.init(); {4255#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:48,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {4255#(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); {4240#true} is VALID [2022-04-15 12:01:48,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {4240#true} assume true; {4240#true} is VALID [2022-04-15 12:01:48,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4240#true} {4240#true} #43#return; {4240#true} is VALID [2022-04-15 12:01:48,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {4240#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {4240#true} is VALID [2022-04-15 12:01:48,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {4240#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; {4245#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {4245#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4245#(= main_~i~0 0)} is VALID [2022-04-15 12:01:48,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {4245#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:48,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {4246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:48,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {4246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:48,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {4247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:48,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {4247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:48,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {4248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:48,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {4248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:48,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {4249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:48,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {4249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:48,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {4250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:48,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {4250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:48,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {4251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:48,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {4251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4252#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:48,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {4252#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4252#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:48,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {4252#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4253#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:48,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {4253#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4253#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:48,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {4253#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4254#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 9))} is VALID [2022-04-15 12:01:48,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {4254#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 9))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {4241#false} is VALID [2022-04-15 12:01:48,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {4241#false} ~i~0 := 0; {4241#false} is VALID [2022-04-15 12:01:48,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {4241#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4241#false} is VALID [2022-04-15 12:01:48,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {4241#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4241#false} is VALID [2022-04-15 12:01:48,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {4241#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4241#false} is VALID [2022-04-15 12:01:48,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {4241#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4241#false} is VALID [2022-04-15 12:01:48,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {4241#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4241#false} is VALID [2022-04-15 12:01:48,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {4241#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4241#false} is VALID [2022-04-15 12:01:48,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {4241#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4241#false} is VALID [2022-04-15 12:01:48,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {4241#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {4241#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {4241#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {4241#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {4241#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {4241#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {4241#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {4241#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {4241#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 42: Hoare triple {4241#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 43: Hoare triple {4241#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 44: Hoare triple {4241#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 45: Hoare triple {4241#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 46: Hoare triple {4241#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 47: Hoare triple {4241#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 48: Hoare triple {4241#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 49: Hoare triple {4241#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 50: Hoare triple {4241#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4241#false} is VALID [2022-04-15 12:01:48,327 INFO L290 TraceCheckUtils]: 51: Hoare triple {4241#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4241#false} is VALID [2022-04-15 12:01:48,328 INFO L290 TraceCheckUtils]: 52: Hoare triple {4241#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4241#false} is VALID [2022-04-15 12:01:48,328 INFO L290 TraceCheckUtils]: 53: Hoare triple {4241#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {4241#false} is VALID [2022-04-15 12:01:48,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {4241#false} assume !false; {4241#false} is VALID [2022-04-15 12:01:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-04-15 12:01:48,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:48,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249834576] [2022-04-15 12:01:48,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249834576] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:48,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038519011] [2022-04-15 12:01:48,329 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:01:48,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:48,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:48,330 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:48,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 12:01:49,047 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 12:01:49,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:49,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 12:01:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:49,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:49,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {4240#true} call ULTIMATE.init(); {4240#true} is VALID [2022-04-15 12:01:49,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {4240#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); {4240#true} is VALID [2022-04-15 12:01:49,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {4240#true} assume true; {4240#true} is VALID [2022-04-15 12:01:49,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4240#true} {4240#true} #43#return; {4240#true} is VALID [2022-04-15 12:01:49,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {4240#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {4240#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; {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {4240#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {4240#true} is VALID [2022-04-15 12:01:49,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {4240#true} ~i~0 := 0; {4245#(= main_~i~0 0)} is VALID [2022-04-15 12:01:49,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {4245#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4245#(= main_~i~0 0)} is VALID [2022-04-15 12:01:49,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {4245#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4245#(= main_~i~0 0)} is VALID [2022-04-15 12:01:49,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {4245#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:49,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {4246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:49,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {4246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:49,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {4246#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:49,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {4247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:49,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {4247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:49,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {4247#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:49,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {4248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:49,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {4248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:49,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {4248#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:49,465 INFO L290 TraceCheckUtils]: 38: Hoare triple {4249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:49,465 INFO L290 TraceCheckUtils]: 39: Hoare triple {4249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:49,466 INFO L290 TraceCheckUtils]: 40: Hoare triple {4249#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:49,466 INFO L290 TraceCheckUtils]: 41: Hoare triple {4250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:49,467 INFO L290 TraceCheckUtils]: 42: Hoare triple {4250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:49,467 INFO L290 TraceCheckUtils]: 43: Hoare triple {4250#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:49,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {4251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:49,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {4251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:49,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {4251#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4252#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:49,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {4252#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4252#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:49,470 INFO L290 TraceCheckUtils]: 48: Hoare triple {4252#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4252#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:49,470 INFO L290 TraceCheckUtils]: 49: Hoare triple {4252#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4253#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:49,471 INFO L290 TraceCheckUtils]: 50: Hoare triple {4253#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4253#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:49,471 INFO L290 TraceCheckUtils]: 51: Hoare triple {4253#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4253#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:49,471 INFO L290 TraceCheckUtils]: 52: Hoare triple {4253#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4415#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:01:49,472 INFO L290 TraceCheckUtils]: 53: Hoare triple {4415#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {4241#false} is VALID [2022-04-15 12:01:49,472 INFO L290 TraceCheckUtils]: 54: Hoare triple {4241#false} assume !false; {4241#false} is VALID [2022-04-15 12:01:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-15 12:01:49,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:49,816 INFO L290 TraceCheckUtils]: 54: Hoare triple {4241#false} assume !false; {4241#false} is VALID [2022-04-15 12:01:49,817 INFO L290 TraceCheckUtils]: 53: Hoare triple {4425#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {4241#false} is VALID [2022-04-15 12:01:49,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {4429#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4425#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:01:49,818 INFO L290 TraceCheckUtils]: 51: Hoare triple {4429#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4429#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,818 INFO L290 TraceCheckUtils]: 50: Hoare triple {4429#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4429#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {4439#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4429#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {4439#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4439#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,819 INFO L290 TraceCheckUtils]: 47: Hoare triple {4439#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4439#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {4449#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4439#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {4449#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4449#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,820 INFO L290 TraceCheckUtils]: 44: Hoare triple {4449#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4449#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,821 INFO L290 TraceCheckUtils]: 43: Hoare triple {4459#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4449#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,821 INFO L290 TraceCheckUtils]: 42: Hoare triple {4459#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4459#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,821 INFO L290 TraceCheckUtils]: 41: Hoare triple {4459#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4459#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {4469#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4459#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,822 INFO L290 TraceCheckUtils]: 39: Hoare triple {4469#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4469#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,822 INFO L290 TraceCheckUtils]: 38: Hoare triple {4469#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4469#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {4479#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4469#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {4479#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4479#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {4479#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4479#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,827 INFO L290 TraceCheckUtils]: 34: Hoare triple {4489#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4479#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {4489#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4489#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {4489#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4489#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {4499#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4489#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {4499#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4499#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {4499#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4499#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {4509#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4499#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {4509#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {4509#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {4509#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {4509#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {4240#true} ~i~0 := 0; {4509#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:01:49,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {4240#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {4240#true} is VALID [2022-04-15 12:01:49,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {4240#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4240#true} is VALID [2022-04-15 12:01:49,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {4240#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {4240#true} is VALID [2022-04-15 12:01:49,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {4240#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; {4240#true} is VALID [2022-04-15 12:01:49,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {4240#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {4240#true} is VALID [2022-04-15 12:01:49,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4240#true} {4240#true} #43#return; {4240#true} is VALID [2022-04-15 12:01:49,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {4240#true} assume true; {4240#true} is VALID [2022-04-15 12:01:49,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {4240#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); {4240#true} is VALID [2022-04-15 12:01:49,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {4240#true} call ULTIMATE.init(); {4240#true} is VALID [2022-04-15 12:01:49,832 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-15 12:01:49,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038519011] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:49,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:49,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-15 12:01:49,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:49,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [274955817] [2022-04-15 12:01:49,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [274955817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:49,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:49,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:01:49,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497091178] [2022-04-15 12:01:49,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:49,833 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 12:01:49,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:49,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:49,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:49,855 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:01:49,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:49,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:01:49,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:01:49,856 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,575 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-04-15 12:01:50,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:01:50,575 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 12:01:50,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-15 12:01:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-15 12:01:50,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 73 transitions. [2022-04-15 12:01:50,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:50,632 INFO L225 Difference]: With dead ends: 95 [2022-04-15 12:01:50,632 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 12:01:50,633 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:01:50,633 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:50,633 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 138 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:01:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 12:01:50,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2022-04-15 12:01:50,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:50,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,684 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,684 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,685 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2022-04-15 12:01:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-04-15 12:01:50,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:50,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:50,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-15 12:01:50,686 INFO L87 Difference]: Start difference. First operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-15 12:01:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,687 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2022-04-15 12:01:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-04-15 12:01:50,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:50,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:50,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:50,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-04-15 12:01:50,688 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 55 [2022-04-15 12:01:50,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:50,688 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-04-15 12:01:50,688 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 62 transitions. [2022-04-15 12:01:50,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-15 12:01:50,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 12:01:50,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:50,738 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:50,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:50,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:50,939 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:50,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1999539772, now seen corresponding path program 19 times [2022-04-15 12:01:50,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:50,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1006872758] [2022-04-15 12:01:50,949 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:50,949 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:50,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1999539772, now seen corresponding path program 20 times [2022-04-15 12:01:50,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:50,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711603309] [2022-04-15 12:01:50,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:50,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:51,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:51,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {5054#(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); {5038#true} is VALID [2022-04-15 12:01:51,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-15 12:01:51,148 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5038#true} {5038#true} #43#return; {5038#true} is VALID [2022-04-15 12:01:51,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {5038#true} call ULTIMATE.init(); {5054#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:51,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {5054#(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); {5038#true} is VALID [2022-04-15 12:01:51,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-15 12:01:51,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5038#true} {5038#true} #43#return; {5038#true} is VALID [2022-04-15 12:01:51,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {5038#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5038#true} is VALID [2022-04-15 12:01:51,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {5038#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; {5043#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {5043#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5043#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {5043#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:51,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {5044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:51,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {5044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:51,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {5045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:51,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {5045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:51,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {5046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:51,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {5046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:51,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {5047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:51,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {5047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5048#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:51,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {5048#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5048#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:51,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {5048#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5049#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:51,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {5049#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5049#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:51,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {5049#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5050#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:51,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {5050#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5050#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:51,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {5050#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5051#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:51,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {5051#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5051#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:51,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {5051#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5052#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:01:51,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {5052#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5052#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:01:51,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {5052#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5053#(and (<= main_~i~0 10) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:51,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {5053#(and (<= main_~i~0 10) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {5039#false} is VALID [2022-04-15 12:01:51,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {5039#false} ~i~0 := 0; {5039#false} is VALID [2022-04-15 12:01:51,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {5039#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5039#false} is VALID [2022-04-15 12:01:51,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {5039#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5039#false} is VALID [2022-04-15 12:01:51,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {5039#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5039#false} is VALID [2022-04-15 12:01:51,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {5039#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5039#false} is VALID [2022-04-15 12:01:51,162 INFO L290 TraceCheckUtils]: 32: Hoare triple {5039#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5039#false} is VALID [2022-04-15 12:01:51,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {5039#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5039#false} is VALID [2022-04-15 12:01:51,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {5039#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5039#false} is VALID [2022-04-15 12:01:51,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {5039#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5039#false} is VALID [2022-04-15 12:01:51,163 INFO L290 TraceCheckUtils]: 36: Hoare triple {5039#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5039#false} is VALID [2022-04-15 12:01:51,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {5039#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5039#false} is VALID [2022-04-15 12:01:51,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {5039#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5039#false} is VALID [2022-04-15 12:01:51,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {5039#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5039#false} is VALID [2022-04-15 12:01:51,163 INFO L290 TraceCheckUtils]: 40: Hoare triple {5039#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5039#false} is VALID [2022-04-15 12:01:51,163 INFO L290 TraceCheckUtils]: 41: Hoare triple {5039#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5039#false} is VALID [2022-04-15 12:01:51,163 INFO L290 TraceCheckUtils]: 42: Hoare triple {5039#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5039#false} is VALID [2022-04-15 12:01:51,163 INFO L290 TraceCheckUtils]: 43: Hoare triple {5039#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5039#false} is VALID [2022-04-15 12:01:51,163 INFO L290 TraceCheckUtils]: 44: Hoare triple {5039#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5039#false} is VALID [2022-04-15 12:01:51,163 INFO L290 TraceCheckUtils]: 45: Hoare triple {5039#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5039#false} is VALID [2022-04-15 12:01:51,163 INFO L290 TraceCheckUtils]: 46: Hoare triple {5039#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5039#false} is VALID [2022-04-15 12:01:51,163 INFO L290 TraceCheckUtils]: 47: Hoare triple {5039#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5039#false} is VALID [2022-04-15 12:01:51,164 INFO L290 TraceCheckUtils]: 48: Hoare triple {5039#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5039#false} is VALID [2022-04-15 12:01:51,164 INFO L290 TraceCheckUtils]: 49: Hoare triple {5039#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5039#false} is VALID [2022-04-15 12:01:51,164 INFO L290 TraceCheckUtils]: 50: Hoare triple {5039#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5039#false} is VALID [2022-04-15 12:01:51,164 INFO L290 TraceCheckUtils]: 51: Hoare triple {5039#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5039#false} is VALID [2022-04-15 12:01:51,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {5039#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5039#false} is VALID [2022-04-15 12:01:51,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {5039#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5039#false} is VALID [2022-04-15 12:01:51,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {5039#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5039#false} is VALID [2022-04-15 12:01:51,164 INFO L290 TraceCheckUtils]: 55: Hoare triple {5039#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5039#false} is VALID [2022-04-15 12:01:51,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {5039#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5039#false} is VALID [2022-04-15 12:01:51,164 INFO L290 TraceCheckUtils]: 57: Hoare triple {5039#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5039#false} is VALID [2022-04-15 12:01:51,164 INFO L290 TraceCheckUtils]: 58: Hoare triple {5039#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {5039#false} is VALID [2022-04-15 12:01:51,164 INFO L290 TraceCheckUtils]: 59: Hoare triple {5039#false} assume !false; {5039#false} is VALID [2022-04-15 12:01:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-15 12:01:51,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:51,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711603309] [2022-04-15 12:01:51,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711603309] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:51,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47101595] [2022-04-15 12:01:51,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:51,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:51,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:51,166 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:51,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 12:01:51,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:01:51,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:51,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 12:01:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:51,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:51,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {5038#true} call ULTIMATE.init(); {5038#true} is VALID [2022-04-15 12:01:51,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {5038#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); {5038#true} is VALID [2022-04-15 12:01:51,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-15 12:01:51,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5038#true} {5038#true} #43#return; {5038#true} is VALID [2022-04-15 12:01:51,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {5038#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5038#true} is VALID [2022-04-15 12:01:51,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {5038#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; {5038#true} is VALID [2022-04-15 12:01:51,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:51,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:51,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:51,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:51,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:51,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:51,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:51,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:51,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:51,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:51,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:51,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:51,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:51,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:51,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:51,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:51,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:51,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:51,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:51,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:51,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {5038#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {5038#true} is VALID [2022-04-15 12:01:51,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {5038#true} ~i~0 := 0; {5043#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {5043#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5043#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {5043#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5043#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {5043#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:51,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {5044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:51,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {5044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:51,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {5044#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:51,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {5045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:51,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {5045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:51,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {5045#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:51,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {5046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:51,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {5046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:51,650 INFO L290 TraceCheckUtils]: 39: Hoare triple {5046#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:51,650 INFO L290 TraceCheckUtils]: 40: Hoare triple {5047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:51,651 INFO L290 TraceCheckUtils]: 41: Hoare triple {5047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:51,651 INFO L290 TraceCheckUtils]: 42: Hoare triple {5047#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5048#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:51,651 INFO L290 TraceCheckUtils]: 43: Hoare triple {5048#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5048#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:51,652 INFO L290 TraceCheckUtils]: 44: Hoare triple {5048#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5048#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:51,652 INFO L290 TraceCheckUtils]: 45: Hoare triple {5048#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5049#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:51,653 INFO L290 TraceCheckUtils]: 46: Hoare triple {5049#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5049#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:51,653 INFO L290 TraceCheckUtils]: 47: Hoare triple {5049#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5049#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:51,653 INFO L290 TraceCheckUtils]: 48: Hoare triple {5049#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5050#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:51,654 INFO L290 TraceCheckUtils]: 49: Hoare triple {5050#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5050#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:51,654 INFO L290 TraceCheckUtils]: 50: Hoare triple {5050#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5050#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:51,654 INFO L290 TraceCheckUtils]: 51: Hoare triple {5050#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5051#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:51,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {5051#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5051#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:51,655 INFO L290 TraceCheckUtils]: 53: Hoare triple {5051#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5051#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:51,656 INFO L290 TraceCheckUtils]: 54: Hoare triple {5051#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5052#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:01:51,656 INFO L290 TraceCheckUtils]: 55: Hoare triple {5052#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5052#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:01:51,656 INFO L290 TraceCheckUtils]: 56: Hoare triple {5052#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5052#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:01:51,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {5052#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5229#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:01:51,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {5229#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {5039#false} is VALID [2022-04-15 12:01:51,658 INFO L290 TraceCheckUtils]: 59: Hoare triple {5039#false} assume !false; {5039#false} is VALID [2022-04-15 12:01:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-15 12:01:51,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:52,045 INFO L290 TraceCheckUtils]: 59: Hoare triple {5039#false} assume !false; {5039#false} is VALID [2022-04-15 12:01:52,046 INFO L290 TraceCheckUtils]: 58: Hoare triple {5239#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {5039#false} is VALID [2022-04-15 12:01:52,046 INFO L290 TraceCheckUtils]: 57: Hoare triple {5243#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5239#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:01:52,047 INFO L290 TraceCheckUtils]: 56: Hoare triple {5243#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5243#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,047 INFO L290 TraceCheckUtils]: 55: Hoare triple {5243#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5243#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,048 INFO L290 TraceCheckUtils]: 54: Hoare triple {5253#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5243#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,048 INFO L290 TraceCheckUtils]: 53: Hoare triple {5253#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5253#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,048 INFO L290 TraceCheckUtils]: 52: Hoare triple {5253#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5253#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,049 INFO L290 TraceCheckUtils]: 51: Hoare triple {5263#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5253#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,049 INFO L290 TraceCheckUtils]: 50: Hoare triple {5263#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5263#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {5263#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5263#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,050 INFO L290 TraceCheckUtils]: 48: Hoare triple {5273#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5263#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,050 INFO L290 TraceCheckUtils]: 47: Hoare triple {5273#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5273#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,051 INFO L290 TraceCheckUtils]: 46: Hoare triple {5273#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5273#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,051 INFO L290 TraceCheckUtils]: 45: Hoare triple {5283#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5273#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {5283#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5283#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,052 INFO L290 TraceCheckUtils]: 43: Hoare triple {5283#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5283#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {5293#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5283#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {5293#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5293#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {5293#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5293#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {5303#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5293#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {5303#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5303#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {5303#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5303#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {5313#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5303#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {5313#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5313#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {5313#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5313#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {5323#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5313#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {5323#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5323#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,057 INFO L290 TraceCheckUtils]: 31: Hoare triple {5323#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5323#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {5333#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5323#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {5333#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5333#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {5333#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5333#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {5038#true} ~i~0 := 0; {5333#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:01:52,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {5038#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {5038#true} is VALID [2022-04-15 12:01:52,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:52,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:52,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {5038#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5038#true} is VALID [2022-04-15 12:01:52,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {5038#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5038#true} is VALID [2022-04-15 12:01:52,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {5038#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; {5038#true} is VALID [2022-04-15 12:01:52,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {5038#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5038#true} is VALID [2022-04-15 12:01:52,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5038#true} {5038#true} #43#return; {5038#true} is VALID [2022-04-15 12:01:52,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {5038#true} assume true; {5038#true} is VALID [2022-04-15 12:01:52,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {5038#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); {5038#true} is VALID [2022-04-15 12:01:52,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {5038#true} call ULTIMATE.init(); {5038#true} is VALID [2022-04-15 12:01:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-15 12:01:52,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47101595] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:52,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:52,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-15 12:01:52,061 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:52,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1006872758] [2022-04-15 12:01:52,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1006872758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:52,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:52,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:01:52,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483726157] [2022-04-15 12:01:52,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:52,061 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 12:01:52,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:52,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:52,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:52,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:01:52,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:52,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:01:52,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:01:52,086 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:52,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:52,923 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2022-04-15 12:01:52,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:01:52,924 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 12:01:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 78 transitions. [2022-04-15 12:01:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:52,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 78 transitions. [2022-04-15 12:01:52,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 78 transitions. [2022-04-15 12:01:53,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:53,010 INFO L225 Difference]: With dead ends: 103 [2022-04-15 12:01:53,010 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 12:01:53,010 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:01:53,011 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:53,011 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 152 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:01:53,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 12:01:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2022-04-15 12:01:53,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:53,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:53,059 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:53,059 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:53,060 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-15 12:01:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-15 12:01:53,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:53,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:53,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 12:01:53,062 INFO L87 Difference]: Start difference. First operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 12:01:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:53,063 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-15 12:01:53,063 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-15 12:01:53,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:53,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:53,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:53,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:53,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2022-04-15 12:01:53,064 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 60 [2022-04-15 12:01:53,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:53,064 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2022-04-15 12:01:53,065 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:53,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 67 transitions. [2022-04-15 12:01:53,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:53,118 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2022-04-15 12:01:53,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 12:01:53,118 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:53,119 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:53,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 12:01:53,331 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 12:01:53,331 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:53,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1686779215, now seen corresponding path program 21 times [2022-04-15 12:01:53,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:53,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [47644307] [2022-04-15 12:01:53,336 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:53,336 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:53,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1686779215, now seen corresponding path program 22 times [2022-04-15 12:01:53,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:53,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722617892] [2022-04-15 12:01:53,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:53,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:53,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:53,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {5921#(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); {5904#true} is VALID [2022-04-15 12:01:53,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {5904#true} assume true; {5904#true} is VALID [2022-04-15 12:01:53,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5904#true} {5904#true} #43#return; {5904#true} is VALID [2022-04-15 12:01:53,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {5904#true} call ULTIMATE.init(); {5921#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:53,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {5921#(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); {5904#true} is VALID [2022-04-15 12:01:53,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {5904#true} assume true; {5904#true} is VALID [2022-04-15 12:01:53,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5904#true} {5904#true} #43#return; {5904#true} is VALID [2022-04-15 12:01:53,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {5904#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5904#true} is VALID [2022-04-15 12:01:53,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {5904#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; {5909#(= main_~i~0 0)} is VALID [2022-04-15 12:01:53,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {5909#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5909#(= main_~i~0 0)} is VALID [2022-04-15 12:01:53,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {5909#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5910#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:53,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {5910#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5910#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:53,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {5910#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5911#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:53,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {5911#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5911#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:53,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {5911#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5912#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:53,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {5912#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5912#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:53,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {5912#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5913#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:53,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {5913#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5913#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:53,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {5913#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5914#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:53,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {5914#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5914#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:53,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {5914#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5915#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:53,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {5915#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5915#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:53,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {5915#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5916#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:53,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {5916#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5916#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:53,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {5916#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5917#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:53,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {5917#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5917#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:53,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {5917#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5918#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:01:53,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {5918#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5918#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:01:53,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {5918#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5919#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:01:53,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {5919#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5919#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:01:53,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {5919#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5920#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 11))} is VALID [2022-04-15 12:01:53,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {5920#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 11))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {5905#false} is VALID [2022-04-15 12:01:53,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {5905#false} ~i~0 := 0; {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {5905#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {5905#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {5905#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {5905#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {5905#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {5905#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {5905#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {5905#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 38: Hoare triple {5905#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 39: Hoare triple {5905#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {5905#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {5905#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {5905#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {5905#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {5905#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {5905#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5905#false} is VALID [2022-04-15 12:01:53,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {5905#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 47: Hoare triple {5905#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 48: Hoare triple {5905#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 49: Hoare triple {5905#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 50: Hoare triple {5905#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 51: Hoare triple {5905#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 52: Hoare triple {5905#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 53: Hoare triple {5905#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 54: Hoare triple {5905#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 55: Hoare triple {5905#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 56: Hoare triple {5905#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 57: Hoare triple {5905#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 58: Hoare triple {5905#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 59: Hoare triple {5905#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 60: Hoare triple {5905#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 61: Hoare triple {5905#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 62: Hoare triple {5905#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 63: Hoare triple {5905#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {5905#false} is VALID [2022-04-15 12:01:53,574 INFO L290 TraceCheckUtils]: 64: Hoare triple {5905#false} assume !false; {5905#false} is VALID [2022-04-15 12:01:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-04-15 12:01:53,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:53,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722617892] [2022-04-15 12:01:53,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722617892] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:53,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121176532] [2022-04-15 12:01:53,575 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:01:53,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:53,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:53,576 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:53,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 12:01:53,755 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:01:53,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:53,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 12:01:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:53,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:54,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {5904#true} call ULTIMATE.init(); {5904#true} is VALID [2022-04-15 12:01:54,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {5904#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); {5904#true} is VALID [2022-04-15 12:01:54,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {5904#true} assume true; {5904#true} is VALID [2022-04-15 12:01:54,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5904#true} {5904#true} #43#return; {5904#true} is VALID [2022-04-15 12:01:54,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {5904#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5904#true} is VALID [2022-04-15 12:01:54,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {5904#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; {5904#true} is VALID [2022-04-15 12:01:54,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {5904#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {5904#true} is VALID [2022-04-15 12:01:54,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {5904#true} ~i~0 := 0; {5909#(= main_~i~0 0)} is VALID [2022-04-15 12:01:54,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {5909#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5909#(= main_~i~0 0)} is VALID [2022-04-15 12:01:54,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {5909#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5909#(= main_~i~0 0)} is VALID [2022-04-15 12:01:54,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {5909#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5910#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:54,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {5910#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5910#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:54,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {5910#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5910#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:54,171 INFO L290 TraceCheckUtils]: 35: Hoare triple {5910#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5911#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:54,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {5911#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5911#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:54,171 INFO L290 TraceCheckUtils]: 37: Hoare triple {5911#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5911#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:54,172 INFO L290 TraceCheckUtils]: 38: Hoare triple {5911#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5912#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:54,172 INFO L290 TraceCheckUtils]: 39: Hoare triple {5912#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5912#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:54,173 INFO L290 TraceCheckUtils]: 40: Hoare triple {5912#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5912#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:54,173 INFO L290 TraceCheckUtils]: 41: Hoare triple {5912#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5913#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:54,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {5913#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5913#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:54,174 INFO L290 TraceCheckUtils]: 43: Hoare triple {5913#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5913#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:54,174 INFO L290 TraceCheckUtils]: 44: Hoare triple {5913#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5914#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:54,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {5914#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5914#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:54,175 INFO L290 TraceCheckUtils]: 46: Hoare triple {5914#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5914#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:54,175 INFO L290 TraceCheckUtils]: 47: Hoare triple {5914#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5915#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:54,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {5915#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5915#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:54,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {5915#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5915#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:54,176 INFO L290 TraceCheckUtils]: 50: Hoare triple {5915#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5916#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:54,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {5916#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5916#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:54,177 INFO L290 TraceCheckUtils]: 52: Hoare triple {5916#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5916#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:54,178 INFO L290 TraceCheckUtils]: 53: Hoare triple {5916#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5917#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:54,178 INFO L290 TraceCheckUtils]: 54: Hoare triple {5917#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5917#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:54,178 INFO L290 TraceCheckUtils]: 55: Hoare triple {5917#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5917#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:54,179 INFO L290 TraceCheckUtils]: 56: Hoare triple {5917#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5918#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:01:54,179 INFO L290 TraceCheckUtils]: 57: Hoare triple {5918#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5918#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:01:54,179 INFO L290 TraceCheckUtils]: 58: Hoare triple {5918#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5918#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:01:54,180 INFO L290 TraceCheckUtils]: 59: Hoare triple {5918#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5919#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:01:54,180 INFO L290 TraceCheckUtils]: 60: Hoare triple {5919#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {5919#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:01:54,180 INFO L290 TraceCheckUtils]: 61: Hoare triple {5919#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {5919#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:01:54,181 INFO L290 TraceCheckUtils]: 62: Hoare triple {5919#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6111#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:01:54,181 INFO L290 TraceCheckUtils]: 63: Hoare triple {6111#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {5905#false} is VALID [2022-04-15 12:01:54,181 INFO L290 TraceCheckUtils]: 64: Hoare triple {5905#false} assume !false; {5905#false} is VALID [2022-04-15 12:01:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-15 12:01:54,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:54,622 INFO L290 TraceCheckUtils]: 64: Hoare triple {5905#false} assume !false; {5905#false} is VALID [2022-04-15 12:01:54,622 INFO L290 TraceCheckUtils]: 63: Hoare triple {6121#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {5905#false} is VALID [2022-04-15 12:01:54,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {6125#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6121#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:01:54,623 INFO L290 TraceCheckUtils]: 61: Hoare triple {6125#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6125#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,624 INFO L290 TraceCheckUtils]: 60: Hoare triple {6125#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6125#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,624 INFO L290 TraceCheckUtils]: 59: Hoare triple {6135#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6125#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,624 INFO L290 TraceCheckUtils]: 58: Hoare triple {6135#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6135#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,625 INFO L290 TraceCheckUtils]: 57: Hoare triple {6135#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6135#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,625 INFO L290 TraceCheckUtils]: 56: Hoare triple {6145#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6135#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,625 INFO L290 TraceCheckUtils]: 55: Hoare triple {6145#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6145#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,626 INFO L290 TraceCheckUtils]: 54: Hoare triple {6145#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6145#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,626 INFO L290 TraceCheckUtils]: 53: Hoare triple {6155#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6145#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,627 INFO L290 TraceCheckUtils]: 52: Hoare triple {6155#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6155#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,627 INFO L290 TraceCheckUtils]: 51: Hoare triple {6155#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6155#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,627 INFO L290 TraceCheckUtils]: 50: Hoare triple {6165#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6155#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,628 INFO L290 TraceCheckUtils]: 49: Hoare triple {6165#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6165#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,628 INFO L290 TraceCheckUtils]: 48: Hoare triple {6165#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6165#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,629 INFO L290 TraceCheckUtils]: 47: Hoare triple {6175#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6165#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,629 INFO L290 TraceCheckUtils]: 46: Hoare triple {6175#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6175#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,629 INFO L290 TraceCheckUtils]: 45: Hoare triple {6175#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6175#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {6185#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6175#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,632 INFO L290 TraceCheckUtils]: 43: Hoare triple {6185#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6185#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,632 INFO L290 TraceCheckUtils]: 42: Hoare triple {6185#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6185#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,633 INFO L290 TraceCheckUtils]: 41: Hoare triple {6195#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6185#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {6195#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6195#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {6195#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6195#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,634 INFO L290 TraceCheckUtils]: 38: Hoare triple {6205#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6195#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {6205#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6205#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {6205#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6205#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {6215#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6205#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {6215#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6215#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {6215#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6215#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {6225#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6215#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {6225#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6225#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {6225#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6225#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {5904#true} ~i~0 := 0; {6225#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:01:54,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {5904#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {5904#true} is VALID [2022-04-15 12:01:54,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {5904#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#true} is VALID [2022-04-15 12:01:54,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {5904#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {5904#true} is VALID [2022-04-15 12:01:54,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {5904#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; {5904#true} is VALID [2022-04-15 12:01:54,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {5904#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {5904#true} is VALID [2022-04-15 12:01:54,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5904#true} {5904#true} #43#return; {5904#true} is VALID [2022-04-15 12:01:54,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {5904#true} assume true; {5904#true} is VALID [2022-04-15 12:01:54,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {5904#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); {5904#true} is VALID [2022-04-15 12:01:54,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {5904#true} call ULTIMATE.init(); {5904#true} is VALID [2022-04-15 12:01:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-15 12:01:54,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121176532] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:54,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:54,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-15 12:01:54,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:54,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [47644307] [2022-04-15 12:01:54,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [47644307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:54,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:54,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:01:54,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164622876] [2022-04-15 12:01:54,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:54,642 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 12:01:54,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:54,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:54,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:54,666 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:01:54,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:54,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:01:54,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:01:54,666 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:55,563 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2022-04-15 12:01:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:01:55,563 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 12:01:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:55,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 83 transitions. [2022-04-15 12:01:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 83 transitions. [2022-04-15 12:01:55,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 83 transitions. [2022-04-15 12:01:55,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:55,625 INFO L225 Difference]: With dead ends: 111 [2022-04-15 12:01:55,625 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 12:01:55,626 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:01:55,627 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 56 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:55,627 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 143 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:01:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 12:01:55,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2022-04-15 12:01:55,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:55,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:55,693 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:55,694 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:55,694 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-04-15 12:01:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-04-15 12:01:55,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:55,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:55,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-15 12:01:55,695 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-15 12:01:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:55,696 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-04-15 12:01:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-04-15 12:01:55,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:55,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:55,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:55,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2022-04-15 12:01:55,697 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 65 [2022-04-15 12:01:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:55,697 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2022-04-15 12:01:55,697 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:55,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 72 transitions. [2022-04-15 12:01:55,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-04-15 12:01:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 12:01:55,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:55,751 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:55,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-15 12:01:55,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 12:01:55,951 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:55,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:55,952 INFO L85 PathProgramCache]: Analyzing trace with hash -595686744, now seen corresponding path program 23 times [2022-04-15 12:01:55,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:55,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [773558120] [2022-04-15 12:01:55,956 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:55,956 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:55,956 INFO L85 PathProgramCache]: Analyzing trace with hash -595686744, now seen corresponding path program 24 times [2022-04-15 12:01:55,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:55,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802160836] [2022-04-15 12:01:55,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:55,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:56,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:56,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {6856#(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); {6838#true} is VALID [2022-04-15 12:01:56,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {6838#true} assume true; {6838#true} is VALID [2022-04-15 12:01:56,201 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6838#true} {6838#true} #43#return; {6838#true} is VALID [2022-04-15 12:01:56,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {6838#true} call ULTIMATE.init(); {6856#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:56,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {6856#(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); {6838#true} is VALID [2022-04-15 12:01:56,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {6838#true} assume true; {6838#true} is VALID [2022-04-15 12:01:56,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6838#true} {6838#true} #43#return; {6838#true} is VALID [2022-04-15 12:01:56,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {6838#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {6838#true} is VALID [2022-04-15 12:01:56,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {6838#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; {6843#(= main_~i~0 0)} is VALID [2022-04-15 12:01:56,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {6843#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6843#(= main_~i~0 0)} is VALID [2022-04-15 12:01:56,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {6843#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6844#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:56,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {6844#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6844#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:01:56,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {6844#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6845#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:56,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {6845#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6845#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:01:56,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {6845#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6846#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:56,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {6846#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6846#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:01:56,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {6846#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6847#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:56,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {6847#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6847#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:01:56,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {6847#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6848#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:56,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {6848#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6848#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:01:56,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {6848#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6849#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:56,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {6849#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6849#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:01:56,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {6849#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6850#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:56,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {6850#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6850#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:01:56,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {6850#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6851#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:56,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {6851#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6851#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:01:56,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {6851#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6852#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:01:56,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {6852#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6852#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:01:56,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {6852#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6853#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:01:56,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {6853#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6853#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:01:56,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {6853#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6854#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:01:56,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {6854#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6854#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:01:56,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {6854#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6855#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 12))} is VALID [2022-04-15 12:01:56,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {6855#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 12))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {6839#false} is VALID [2022-04-15 12:01:56,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {6839#false} ~i~0 := 0; {6839#false} is VALID [2022-04-15 12:01:56,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:01:56,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:01:56,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:01:56,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:01:56,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:01:56,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:01:56,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:01:56,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:01:56,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:01:56,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:01:56,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:01:56,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:01:56,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:01:56,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:01:56,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 47: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 48: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 50: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 51: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 52: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 55: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 56: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 57: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 58: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 59: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 60: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 61: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 62: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 63: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 64: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:01:56,234 INFO L290 TraceCheckUtils]: 65: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:01:56,235 INFO L290 TraceCheckUtils]: 66: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:01:56,235 INFO L290 TraceCheckUtils]: 67: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:01:56,235 INFO L290 TraceCheckUtils]: 68: Hoare triple {6839#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {6839#false} is VALID [2022-04-15 12:01:56,235 INFO L290 TraceCheckUtils]: 69: Hoare triple {6839#false} assume !false; {6839#false} is VALID [2022-04-15 12:01:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-15 12:01:56,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:56,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802160836] [2022-04-15 12:01:56,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802160836] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:56,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078353193] [2022-04-15 12:01:56,235 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:01:56,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:56,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:56,236 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:56,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 12:02:02,817 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-15 12:02:02,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:02,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:02:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:02,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:03,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {6838#true} call ULTIMATE.init(); {6838#true} is VALID [2022-04-15 12:02:03,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {6838#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); {6838#true} is VALID [2022-04-15 12:02:03,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {6838#true} assume true; {6838#true} is VALID [2022-04-15 12:02:03,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6838#true} {6838#true} #43#return; {6838#true} is VALID [2022-04-15 12:02:03,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {6838#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {6838#true} is VALID [2022-04-15 12:02:03,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {6838#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; {6843#(= main_~i~0 0)} is VALID [2022-04-15 12:02:03,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {6843#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6843#(= main_~i~0 0)} is VALID [2022-04-15 12:02:03,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {6843#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6844#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:03,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {6844#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6844#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:03,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {6844#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6845#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:03,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {6845#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6845#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:03,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {6845#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6846#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:03,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {6846#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6846#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:03,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {6846#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6847#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:03,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {6847#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6847#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:03,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {6847#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6848#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:03,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {6848#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6848#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:03,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {6848#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6849#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:03,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {6849#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6849#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:03,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {6849#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6850#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:03,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {6850#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6850#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:03,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {6850#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6851#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:03,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {6851#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6851#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:03,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {6851#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6852#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:03,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {6852#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6852#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:03,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {6852#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6853#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:03,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {6853#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6853#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:03,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {6853#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6854#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:03,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {6854#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {6854#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:03,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {6854#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6947#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:03,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {6947#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {6839#false} is VALID [2022-04-15 12:02:03,200 INFO L290 TraceCheckUtils]: 31: Hoare triple {6839#false} ~i~0 := 0; {6839#false} is VALID [2022-04-15 12:02:03,200 INFO L290 TraceCheckUtils]: 32: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,200 INFO L290 TraceCheckUtils]: 37: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,200 INFO L290 TraceCheckUtils]: 43: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 45: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 46: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 47: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 48: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 50: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 51: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 52: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 54: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 55: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 56: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 57: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 58: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 59: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 60: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,201 INFO L290 TraceCheckUtils]: 62: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,202 INFO L290 TraceCheckUtils]: 63: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,202 INFO L290 TraceCheckUtils]: 64: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,202 INFO L290 TraceCheckUtils]: 65: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,202 INFO L290 TraceCheckUtils]: 66: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,202 INFO L290 TraceCheckUtils]: 67: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,202 INFO L290 TraceCheckUtils]: 68: Hoare triple {6839#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {6839#false} is VALID [2022-04-15 12:02:03,202 INFO L290 TraceCheckUtils]: 69: Hoare triple {6839#false} assume !false; {6839#false} is VALID [2022-04-15 12:02:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-15 12:02:03,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:03,647 INFO L290 TraceCheckUtils]: 69: Hoare triple {6839#false} assume !false; {6839#false} is VALID [2022-04-15 12:02:03,647 INFO L290 TraceCheckUtils]: 68: Hoare triple {6839#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {6839#false} is VALID [2022-04-15 12:02:03,647 INFO L290 TraceCheckUtils]: 67: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,647 INFO L290 TraceCheckUtils]: 66: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,647 INFO L290 TraceCheckUtils]: 65: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 64: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 63: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 62: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 61: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 60: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 59: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 58: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 57: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 56: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 55: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 54: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 53: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 52: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 51: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 50: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,648 INFO L290 TraceCheckUtils]: 48: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 47: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 46: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 45: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 44: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {6839#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {6839#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {6839#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {6839#false} is VALID [2022-04-15 12:02:03,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {6839#false} ~i~0 := 0; {6839#false} is VALID [2022-04-15 12:02:03,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {7185#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {6839#false} is VALID [2022-04-15 12:02:03,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {7189#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7185#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:02:03,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {7189#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7189#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {7196#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7189#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {7196#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7196#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {7203#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7196#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {7203#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7203#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {7210#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7203#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {7210#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7210#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {7217#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7210#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {7217#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7217#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {7224#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7217#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {7224#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7224#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {7231#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7224#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {7231#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7231#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {7238#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7231#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {7238#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7238#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {7245#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7238#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {7245#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7245#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {7252#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7245#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {7252#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7252#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {7259#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7252#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {7259#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7259#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {7266#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7259#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {7266#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7266#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {6838#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; {7266#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:02:03,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {6838#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {6838#true} is VALID [2022-04-15 12:02:03,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6838#true} {6838#true} #43#return; {6838#true} is VALID [2022-04-15 12:02:03,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {6838#true} assume true; {6838#true} is VALID [2022-04-15 12:02:03,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {6838#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); {6838#true} is VALID [2022-04-15 12:02:03,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {6838#true} call ULTIMATE.init(); {6838#true} is VALID [2022-04-15 12:02:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-15 12:02:03,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078353193] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:03,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:03,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-15 12:02:03,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:03,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [773558120] [2022-04-15 12:02:03,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [773558120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:03,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:03,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:02:03,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346274649] [2022-04-15 12:02:03,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:03,669 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 12:02:03,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:03,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:03,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:03,698 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:02:03,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:03,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:02:03,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:02:03,699 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:04,763 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2022-04-15 12:02:04,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:02:04,764 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 12:02:04,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:04,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 88 transitions. [2022-04-15 12:02:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 88 transitions. [2022-04-15 12:02:04,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 88 transitions. [2022-04-15 12:02:04,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:04,826 INFO L225 Difference]: With dead ends: 119 [2022-04-15 12:02:04,826 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 12:02:04,826 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:02:04,827 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 41 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:04,827 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 216 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:02:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 12:02:04,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-04-15 12:02:04,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:04,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:04,890 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:04,890 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:04,892 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2022-04-15 12:02:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-15 12:02:04,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:04,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:04,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 12:02:04,892 INFO L87 Difference]: Start difference. First operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 12:02:04,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:04,893 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2022-04-15 12:02:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-15 12:02:04,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:04,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:04,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:04,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:04,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2022-04-15 12:02:04,894 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 70 [2022-04-15 12:02:04,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:04,895 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2022-04-15 12:02:04,895 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:04,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 77 transitions. [2022-04-15 12:02:04,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2022-04-15 12:02:04,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 12:02:04,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:04,963 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:04,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:05,167 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 12:02:05,167 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:05,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:05,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1264174643, now seen corresponding path program 25 times [2022-04-15 12:02:05,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:05,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1586849113] [2022-04-15 12:02:05,172 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:05,172 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:05,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1264174643, now seen corresponding path program 26 times [2022-04-15 12:02:05,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:05,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106424451] [2022-04-15 12:02:05,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:05,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:05,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:05,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {7859#(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); {7840#true} is VALID [2022-04-15 12:02:05,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {7840#true} assume true; {7840#true} is VALID [2022-04-15 12:02:05,443 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7840#true} {7840#true} #43#return; {7840#true} is VALID [2022-04-15 12:02:05,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {7840#true} call ULTIMATE.init(); {7859#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:05,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {7859#(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); {7840#true} is VALID [2022-04-15 12:02:05,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {7840#true} assume true; {7840#true} is VALID [2022-04-15 12:02:05,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7840#true} {7840#true} #43#return; {7840#true} is VALID [2022-04-15 12:02:05,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {7840#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {7840#true} is VALID [2022-04-15 12:02:05,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {7840#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; {7845#(= main_~i~0 0)} is VALID [2022-04-15 12:02:05,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {7845#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7845#(= main_~i~0 0)} is VALID [2022-04-15 12:02:05,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {7845#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:05,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {7846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:05,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {7846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:05,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {7847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:05,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {7847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:05,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {7848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:05,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {7848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:05,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {7849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:05,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {7849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:05,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {7850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:05,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {7850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:05,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {7851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:05,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {7851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:05,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {7852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:05,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {7852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:05,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {7853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:05,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {7853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:05,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {7854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:05,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {7854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:05,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {7855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:05,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {7855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:05,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {7856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:05,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {7856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7857#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:05,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {7857#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7857#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:05,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {7857#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7858#(and (<= main_~i~0 13) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:02:05,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {7858#(and (<= main_~i~0 13) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {7841#false} is VALID [2022-04-15 12:02:05,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {7841#false} ~i~0 := 0; {7841#false} is VALID [2022-04-15 12:02:05,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,455 INFO L290 TraceCheckUtils]: 36: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,455 INFO L290 TraceCheckUtils]: 37: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,455 INFO L290 TraceCheckUtils]: 38: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,455 INFO L290 TraceCheckUtils]: 40: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,455 INFO L290 TraceCheckUtils]: 41: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,455 INFO L290 TraceCheckUtils]: 42: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 43: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 44: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 45: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 46: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 47: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 48: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 49: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 50: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 51: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 52: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 53: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 54: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 55: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 56: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 57: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 58: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 59: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,456 INFO L290 TraceCheckUtils]: 60: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,457 INFO L290 TraceCheckUtils]: 61: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,457 INFO L290 TraceCheckUtils]: 62: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,457 INFO L290 TraceCheckUtils]: 63: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,457 INFO L290 TraceCheckUtils]: 64: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,457 INFO L290 TraceCheckUtils]: 65: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,457 INFO L290 TraceCheckUtils]: 66: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,457 INFO L290 TraceCheckUtils]: 67: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,457 INFO L290 TraceCheckUtils]: 68: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,457 INFO L290 TraceCheckUtils]: 69: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,457 INFO L290 TraceCheckUtils]: 71: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,457 INFO L290 TraceCheckUtils]: 72: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,457 INFO L290 TraceCheckUtils]: 73: Hoare triple {7841#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {7841#false} is VALID [2022-04-15 12:02:05,457 INFO L290 TraceCheckUtils]: 74: Hoare triple {7841#false} assume !false; {7841#false} is VALID [2022-04-15 12:02:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2022-04-15 12:02:05,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:05,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106424451] [2022-04-15 12:02:05,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106424451] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:05,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000797803] [2022-04-15 12:02:05,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:02:05,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:05,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:05,459 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:05,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 12:02:05,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:02:05,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:05,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 12:02:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:05,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:05,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {7840#true} call ULTIMATE.init(); {7840#true} is VALID [2022-04-15 12:02:05,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {7840#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); {7840#true} is VALID [2022-04-15 12:02:05,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {7840#true} assume true; {7840#true} is VALID [2022-04-15 12:02:05,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7840#true} {7840#true} #43#return; {7840#true} is VALID [2022-04-15 12:02:05,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {7840#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {7840#true} is VALID [2022-04-15 12:02:05,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {7840#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; {7845#(= main_~i~0 0)} is VALID [2022-04-15 12:02:05,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {7845#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7845#(= main_~i~0 0)} is VALID [2022-04-15 12:02:05,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {7845#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:05,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {7846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:05,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {7846#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:05,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {7847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:05,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {7847#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:05,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {7848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:05,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {7848#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:05,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {7849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:05,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {7849#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:05,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {7850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:05,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {7850#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:05,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {7851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:05,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {7851#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:05,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {7852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:05,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {7852#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:05,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {7853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:05,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {7853#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:05,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {7854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:05,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {7854#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:05,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {7855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:05,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {7855#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:05,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {7856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:05,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {7856#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7857#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:05,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {7857#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {7857#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:05,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {7857#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7956#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:05,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {7956#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {7841#false} is VALID [2022-04-15 12:02:05,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {7841#false} ~i~0 := 0; {7841#false} is VALID [2022-04-15 12:02:05,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,984 INFO L290 TraceCheckUtils]: 43: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,984 INFO L290 TraceCheckUtils]: 44: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,984 INFO L290 TraceCheckUtils]: 45: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,984 INFO L290 TraceCheckUtils]: 46: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,984 INFO L290 TraceCheckUtils]: 47: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 48: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 49: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 50: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 51: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 52: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 53: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 54: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 55: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 56: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 57: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 58: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 59: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 60: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 61: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 62: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 63: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 64: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,985 INFO L290 TraceCheckUtils]: 65: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,986 INFO L290 TraceCheckUtils]: 66: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,986 INFO L290 TraceCheckUtils]: 67: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,986 INFO L290 TraceCheckUtils]: 68: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,986 INFO L290 TraceCheckUtils]: 69: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,986 INFO L290 TraceCheckUtils]: 70: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:05,986 INFO L290 TraceCheckUtils]: 71: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:05,986 INFO L290 TraceCheckUtils]: 72: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:05,986 INFO L290 TraceCheckUtils]: 73: Hoare triple {7841#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {7841#false} is VALID [2022-04-15 12:02:05,986 INFO L290 TraceCheckUtils]: 74: Hoare triple {7841#false} assume !false; {7841#false} is VALID [2022-04-15 12:02:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2022-04-15 12:02:05,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:06,524 INFO L290 TraceCheckUtils]: 74: Hoare triple {7841#false} assume !false; {7841#false} is VALID [2022-04-15 12:02:06,524 INFO L290 TraceCheckUtils]: 73: Hoare triple {7841#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {7841#false} is VALID [2022-04-15 12:02:06,524 INFO L290 TraceCheckUtils]: 72: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:06,524 INFO L290 TraceCheckUtils]: 71: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:06,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:06,524 INFO L290 TraceCheckUtils]: 69: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:06,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:06,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 66: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 65: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 64: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 63: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 62: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 61: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 60: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 59: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 58: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 57: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 56: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 55: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 54: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 53: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 52: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 51: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:06,525 INFO L290 TraceCheckUtils]: 50: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 49: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 48: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 47: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 46: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 45: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {7841#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {7841#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {7841#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {7841#false} is VALID [2022-04-15 12:02:06,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {7841#false} ~i~0 := 0; {7841#false} is VALID [2022-04-15 12:02:06,527 INFO L290 TraceCheckUtils]: 32: Hoare triple {8212#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {7841#false} is VALID [2022-04-15 12:02:06,527 INFO L290 TraceCheckUtils]: 31: Hoare triple {8216#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8212#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:02:06,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {8216#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8216#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {8223#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8216#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {8223#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8223#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {8230#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8223#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {8230#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8230#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {8237#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8230#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,530 INFO L290 TraceCheckUtils]: 24: Hoare triple {8237#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8237#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {8244#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8237#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {8244#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8244#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {8251#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8244#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {8251#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8251#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {8258#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8251#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {8258#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8258#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {8265#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8258#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {8265#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8265#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {8272#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8265#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {8272#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8272#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {8279#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8272#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {8279#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8279#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {8286#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8279#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {8286#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8286#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {8293#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8286#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {8293#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8293#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {8300#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8293#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {8300#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8300#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {7840#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; {8300#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:02:06,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {7840#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {7840#true} is VALID [2022-04-15 12:02:06,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7840#true} {7840#true} #43#return; {7840#true} is VALID [2022-04-15 12:02:06,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {7840#true} assume true; {7840#true} is VALID [2022-04-15 12:02:06,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {7840#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); {7840#true} is VALID [2022-04-15 12:02:06,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {7840#true} call ULTIMATE.init(); {7840#true} is VALID [2022-04-15 12:02:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2022-04-15 12:02:06,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000797803] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:06,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:06,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-15 12:02:06,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:06,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1586849113] [2022-04-15 12:02:06,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1586849113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:06,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:06,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:02:06,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223489345] [2022-04-15 12:02:06,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:06,540 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 12:02:06,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:06,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:06,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:06,568 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:02:06,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:06,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:02:06,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:02:06,569 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:07,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:07,706 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2022-04-15 12:02:07,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:02:07,707 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 12:02:07,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 93 transitions. [2022-04-15 12:02:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 93 transitions. [2022-04-15 12:02:07,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 93 transitions. [2022-04-15 12:02:07,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:07,772 INFO L225 Difference]: With dead ends: 127 [2022-04-15 12:02:07,772 INFO L226 Difference]: Without dead ends: 84 [2022-04-15 12:02:07,772 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=304, Invalid=752, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:02:07,773 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 68 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:07,773 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 186 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:02:07,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-15 12:02:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2022-04-15 12:02:07,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:07,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:07,840 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:07,840 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:07,841 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2022-04-15 12:02:07,841 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2022-04-15 12:02:07,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:07,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:07,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-15 12:02:07,841 INFO L87 Difference]: Start difference. First operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-15 12:02:07,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:07,842 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2022-04-15 12:02:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2022-04-15 12:02:07,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:07,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:07,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:07,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2022-04-15 12:02:07,844 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 75 [2022-04-15 12:02:07,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:07,844 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2022-04-15 12:02:07,844 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:07,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 82 transitions. [2022-04-15 12:02:07,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:07,897 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-04-15 12:02:07,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 12:02:07,898 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:07,898 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:07,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-15 12:02:08,114 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 12:02:08,114 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:08,115 INFO L85 PathProgramCache]: Analyzing trace with hash 407708556, now seen corresponding path program 27 times [2022-04-15 12:02:08,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:08,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [655562315] [2022-04-15 12:02:08,119 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:08,119 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:08,119 INFO L85 PathProgramCache]: Analyzing trace with hash 407708556, now seen corresponding path program 28 times [2022-04-15 12:02:08,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:08,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48560365] [2022-04-15 12:02:08,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:08,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:08,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:08,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {8930#(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); {8910#true} is VALID [2022-04-15 12:02:08,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {8910#true} assume true; {8910#true} is VALID [2022-04-15 12:02:08,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8910#true} {8910#true} #43#return; {8910#true} is VALID [2022-04-15 12:02:08,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {8910#true} call ULTIMATE.init(); {8930#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:08,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {8930#(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); {8910#true} is VALID [2022-04-15 12:02:08,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {8910#true} assume true; {8910#true} is VALID [2022-04-15 12:02:08,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8910#true} {8910#true} #43#return; {8910#true} is VALID [2022-04-15 12:02:08,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {8910#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {8910#true} is VALID [2022-04-15 12:02:08,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {8910#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; {8915#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {8915#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8915#(= main_~i~0 0)} is VALID [2022-04-15 12:02:08,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {8915#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8916#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:08,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {8916#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8916#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:08,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {8916#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8917#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:08,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {8917#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8917#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:08,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {8917#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8918#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:08,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {8918#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8918#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:08,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {8918#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8919#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:08,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {8919#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8919#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:08,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {8919#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8920#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:08,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {8920#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8920#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:08,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {8920#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8921#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:08,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {8921#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8921#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:08,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {8921#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8922#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:08,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {8922#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8922#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:08,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {8922#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8923#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:08,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {8923#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8923#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:08,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {8923#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8924#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:08,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {8924#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8924#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:08,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {8924#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8925#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:08,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {8925#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8925#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:08,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {8925#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8926#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:08,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {8926#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8926#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:08,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {8926#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8927#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:08,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {8927#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8927#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:08,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {8927#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8928#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:08,425 INFO L290 TraceCheckUtils]: 32: Hoare triple {8928#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8928#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:08,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {8928#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8929#(and (<= main_~i~0 14) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:02:08,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {8929#(and (<= main_~i~0 14) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {8911#false} is VALID [2022-04-15 12:02:08,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {8911#false} ~i~0 := 0; {8911#false} is VALID [2022-04-15 12:02:08,426 INFO L290 TraceCheckUtils]: 36: Hoare triple {8911#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8911#false} is VALID [2022-04-15 12:02:08,426 INFO L290 TraceCheckUtils]: 37: Hoare triple {8911#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8911#false} is VALID [2022-04-15 12:02:08,426 INFO L290 TraceCheckUtils]: 38: Hoare triple {8911#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8911#false} is VALID [2022-04-15 12:02:08,426 INFO L290 TraceCheckUtils]: 39: Hoare triple {8911#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8911#false} is VALID [2022-04-15 12:02:08,426 INFO L290 TraceCheckUtils]: 40: Hoare triple {8911#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 41: Hoare triple {8911#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 42: Hoare triple {8911#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 43: Hoare triple {8911#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 44: Hoare triple {8911#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 45: Hoare triple {8911#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 46: Hoare triple {8911#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 47: Hoare triple {8911#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {8911#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 49: Hoare triple {8911#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 50: Hoare triple {8911#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 51: Hoare triple {8911#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 52: Hoare triple {8911#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {8911#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 54: Hoare triple {8911#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 55: Hoare triple {8911#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 56: Hoare triple {8911#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 57: Hoare triple {8911#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8911#false} is VALID [2022-04-15 12:02:08,427 INFO L290 TraceCheckUtils]: 58: Hoare triple {8911#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 59: Hoare triple {8911#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 60: Hoare triple {8911#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 61: Hoare triple {8911#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 62: Hoare triple {8911#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 63: Hoare triple {8911#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 64: Hoare triple {8911#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 65: Hoare triple {8911#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 66: Hoare triple {8911#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 67: Hoare triple {8911#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 68: Hoare triple {8911#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 69: Hoare triple {8911#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 70: Hoare triple {8911#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 71: Hoare triple {8911#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 72: Hoare triple {8911#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 73: Hoare triple {8911#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 74: Hoare triple {8911#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 75: Hoare triple {8911#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 76: Hoare triple {8911#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8911#false} is VALID [2022-04-15 12:02:08,428 INFO L290 TraceCheckUtils]: 77: Hoare triple {8911#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8911#false} is VALID [2022-04-15 12:02:08,429 INFO L290 TraceCheckUtils]: 78: Hoare triple {8911#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {8911#false} is VALID [2022-04-15 12:02:08,429 INFO L290 TraceCheckUtils]: 79: Hoare triple {8911#false} assume !false; {8911#false} is VALID [2022-04-15 12:02:08,429 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2022-04-15 12:02:08,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:08,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48560365] [2022-04-15 12:02:08,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48560365] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:08,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541601250] [2022-04-15 12:02:08,429 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:02:08,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:08,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:08,430 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:08,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 12:02:10,241 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:02:10,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:10,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 12:02:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:10,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:10,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {8910#true} call ULTIMATE.init(); {8910#true} is VALID [2022-04-15 12:02:10,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {8910#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); {8910#true} is VALID [2022-04-15 12:02:10,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {8910#true} assume true; {8910#true} is VALID [2022-04-15 12:02:10,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8910#true} {8910#true} #43#return; {8910#true} is VALID [2022-04-15 12:02:10,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {8910#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {8910#true} is VALID [2022-04-15 12:02:10,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {8910#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; {8910#true} is VALID [2022-04-15 12:02:10,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:10,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:10,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:10,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:10,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:10,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:10,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:10,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:10,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:10,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:10,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:10,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {8910#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {8910#true} is VALID [2022-04-15 12:02:10,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {8910#true} ~i~0 := 0; {8915#(= main_~i~0 0)} is VALID [2022-04-15 12:02:10,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {8915#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8915#(= main_~i~0 0)} is VALID [2022-04-15 12:02:10,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {8915#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8915#(= main_~i~0 0)} is VALID [2022-04-15 12:02:10,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {8915#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8916#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:10,741 INFO L290 TraceCheckUtils]: 39: Hoare triple {8916#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8916#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:10,741 INFO L290 TraceCheckUtils]: 40: Hoare triple {8916#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8916#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:10,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {8916#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8917#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:10,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {8917#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8917#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:10,743 INFO L290 TraceCheckUtils]: 43: Hoare triple {8917#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8917#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:10,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {8917#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8918#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:10,743 INFO L290 TraceCheckUtils]: 45: Hoare triple {8918#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8918#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:10,744 INFO L290 TraceCheckUtils]: 46: Hoare triple {8918#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8918#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:10,744 INFO L290 TraceCheckUtils]: 47: Hoare triple {8918#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8919#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:10,745 INFO L290 TraceCheckUtils]: 48: Hoare triple {8919#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8919#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:10,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {8919#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8919#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:10,745 INFO L290 TraceCheckUtils]: 50: Hoare triple {8919#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8920#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:10,746 INFO L290 TraceCheckUtils]: 51: Hoare triple {8920#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8920#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:10,746 INFO L290 TraceCheckUtils]: 52: Hoare triple {8920#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8920#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:10,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {8920#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8921#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:10,747 INFO L290 TraceCheckUtils]: 54: Hoare triple {8921#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8921#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:10,747 INFO L290 TraceCheckUtils]: 55: Hoare triple {8921#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8921#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:10,747 INFO L290 TraceCheckUtils]: 56: Hoare triple {8921#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8922#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:10,748 INFO L290 TraceCheckUtils]: 57: Hoare triple {8922#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8922#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:10,748 INFO L290 TraceCheckUtils]: 58: Hoare triple {8922#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8922#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:10,749 INFO L290 TraceCheckUtils]: 59: Hoare triple {8922#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8923#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:10,749 INFO L290 TraceCheckUtils]: 60: Hoare triple {8923#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8923#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:10,749 INFO L290 TraceCheckUtils]: 61: Hoare triple {8923#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8923#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:10,750 INFO L290 TraceCheckUtils]: 62: Hoare triple {8923#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8924#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:10,750 INFO L290 TraceCheckUtils]: 63: Hoare triple {8924#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8924#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:10,750 INFO L290 TraceCheckUtils]: 64: Hoare triple {8924#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8924#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:10,751 INFO L290 TraceCheckUtils]: 65: Hoare triple {8924#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8925#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:10,751 INFO L290 TraceCheckUtils]: 66: Hoare triple {8925#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8925#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:10,751 INFO L290 TraceCheckUtils]: 67: Hoare triple {8925#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8925#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:10,752 INFO L290 TraceCheckUtils]: 68: Hoare triple {8925#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8926#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:10,752 INFO L290 TraceCheckUtils]: 69: Hoare triple {8926#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8926#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:10,752 INFO L290 TraceCheckUtils]: 70: Hoare triple {8926#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8926#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:10,753 INFO L290 TraceCheckUtils]: 71: Hoare triple {8926#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8927#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:10,753 INFO L290 TraceCheckUtils]: 72: Hoare triple {8927#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8927#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:10,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {8927#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8927#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:10,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {8927#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8928#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:10,754 INFO L290 TraceCheckUtils]: 75: Hoare triple {8928#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {8928#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:10,755 INFO L290 TraceCheckUtils]: 76: Hoare triple {8928#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {8928#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:10,755 INFO L290 TraceCheckUtils]: 77: Hoare triple {8928#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9165#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:02:10,756 INFO L290 TraceCheckUtils]: 78: Hoare triple {9165#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {8911#false} is VALID [2022-04-15 12:02:10,756 INFO L290 TraceCheckUtils]: 79: Hoare triple {8911#false} assume !false; {8911#false} is VALID [2022-04-15 12:02:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-15 12:02:10,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:11,315 INFO L290 TraceCheckUtils]: 79: Hoare triple {8911#false} assume !false; {8911#false} is VALID [2022-04-15 12:02:11,316 INFO L290 TraceCheckUtils]: 78: Hoare triple {9175#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {8911#false} is VALID [2022-04-15 12:02:11,317 INFO L290 TraceCheckUtils]: 77: Hoare triple {9179#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9175#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:02:11,317 INFO L290 TraceCheckUtils]: 76: Hoare triple {9179#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {9179#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,317 INFO L290 TraceCheckUtils]: 75: Hoare triple {9179#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {9179#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,318 INFO L290 TraceCheckUtils]: 74: Hoare triple {9189#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9179#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,318 INFO L290 TraceCheckUtils]: 73: Hoare triple {9189#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {9189#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,318 INFO L290 TraceCheckUtils]: 72: Hoare triple {9189#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {9189#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,319 INFO L290 TraceCheckUtils]: 71: Hoare triple {9199#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9189#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,319 INFO L290 TraceCheckUtils]: 70: Hoare triple {9199#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {9199#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,320 INFO L290 TraceCheckUtils]: 69: Hoare triple {9199#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {9199#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,320 INFO L290 TraceCheckUtils]: 68: Hoare triple {9209#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9199#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,320 INFO L290 TraceCheckUtils]: 67: Hoare triple {9209#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {9209#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,321 INFO L290 TraceCheckUtils]: 66: Hoare triple {9209#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {9209#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,321 INFO L290 TraceCheckUtils]: 65: Hoare triple {9219#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9209#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,322 INFO L290 TraceCheckUtils]: 64: Hoare triple {9219#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {9219#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,322 INFO L290 TraceCheckUtils]: 63: Hoare triple {9219#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {9219#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,322 INFO L290 TraceCheckUtils]: 62: Hoare triple {9229#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9219#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,323 INFO L290 TraceCheckUtils]: 61: Hoare triple {9229#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {9229#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,323 INFO L290 TraceCheckUtils]: 60: Hoare triple {9229#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {9229#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,324 INFO L290 TraceCheckUtils]: 59: Hoare triple {9239#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9229#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,324 INFO L290 TraceCheckUtils]: 58: Hoare triple {9239#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {9239#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,324 INFO L290 TraceCheckUtils]: 57: Hoare triple {9239#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {9239#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {9249#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9239#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,325 INFO L290 TraceCheckUtils]: 55: Hoare triple {9249#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {9249#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,325 INFO L290 TraceCheckUtils]: 54: Hoare triple {9249#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {9249#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,326 INFO L290 TraceCheckUtils]: 53: Hoare triple {9259#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9249#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,326 INFO L290 TraceCheckUtils]: 52: Hoare triple {9259#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {9259#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,326 INFO L290 TraceCheckUtils]: 51: Hoare triple {9259#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {9259#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,327 INFO L290 TraceCheckUtils]: 50: Hoare triple {9269#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9259#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,327 INFO L290 TraceCheckUtils]: 49: Hoare triple {9269#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {9269#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,327 INFO L290 TraceCheckUtils]: 48: Hoare triple {9269#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {9269#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,328 INFO L290 TraceCheckUtils]: 47: Hoare triple {9279#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9269#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,328 INFO L290 TraceCheckUtils]: 46: Hoare triple {9279#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {9279#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {9279#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {9279#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {9289#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9279#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {9289#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {9289#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,330 INFO L290 TraceCheckUtils]: 42: Hoare triple {9289#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {9289#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,330 INFO L290 TraceCheckUtils]: 41: Hoare triple {9299#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9289#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {9299#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {9299#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,331 INFO L290 TraceCheckUtils]: 39: Hoare triple {9299#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {9299#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {9309#(< (mod (+ main_~i~0 14) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9299#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,332 INFO L290 TraceCheckUtils]: 37: Hoare triple {9309#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {9309#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {9309#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {9309#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {8910#true} ~i~0 := 0; {9309#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:02:11,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {8910#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {8910#true} is VALID [2022-04-15 12:02:11,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:11,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:11,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:11,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:11,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:11,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:11,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:11,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:11,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:11,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:11,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:11,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:11,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:11,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:11,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:11,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:11,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:11,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:11,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:11,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:11,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:11,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:11,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:11,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:11,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:11,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:11,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {8910#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8910#true} is VALID [2022-04-15 12:02:11,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {8910#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {8910#true} is VALID [2022-04-15 12:02:11,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {8910#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; {8910#true} is VALID [2022-04-15 12:02:11,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {8910#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {8910#true} is VALID [2022-04-15 12:02:11,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8910#true} {8910#true} #43#return; {8910#true} is VALID [2022-04-15 12:02:11,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {8910#true} assume true; {8910#true} is VALID [2022-04-15 12:02:11,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {8910#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); {8910#true} is VALID [2022-04-15 12:02:11,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {8910#true} call ULTIMATE.init(); {8910#true} is VALID [2022-04-15 12:02:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-15 12:02:11,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541601250] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:11,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:11,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-15 12:02:11,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:11,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [655562315] [2022-04-15 12:02:11,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [655562315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:11,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:11,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:02:11,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481596324] [2022-04-15 12:02:11,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:11,336 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-15 12:02:11,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:11,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:11,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:11,369 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:02:11,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:11,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:02:11,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:02:11,370 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:12,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:12,763 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2022-04-15 12:02:12,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:02:12,763 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-15 12:02:12,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2022-04-15 12:02:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2022-04-15 12:02:12,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 98 transitions. [2022-04-15 12:02:12,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:12,854 INFO L225 Difference]: With dead ends: 135 [2022-04-15 12:02:12,854 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 12:02:12,857 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=340, Invalid=850, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 12:02:12,857 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:12,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 283 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:02:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 12:02:12,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-04-15 12:02:12,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:12,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:12,932 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:12,932 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:12,933 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-04-15 12:02:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-15 12:02:12,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:12,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:12,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-15 12:02:12,934 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-15 12:02:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:12,934 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-04-15 12:02:12,935 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-15 12:02:12,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:12,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:12,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:12,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2022-04-15 12:02:12,936 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 80 [2022-04-15 12:02:12,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:12,936 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2022-04-15 12:02:12,936 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:12,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 87 transitions. [2022-04-15 12:02:13,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:13,003 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2022-04-15 12:02:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 12:02:13,003 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:13,003 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:13,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-15 12:02:13,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:13,204 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:13,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:13,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1855190807, now seen corresponding path program 29 times [2022-04-15 12:02:13,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:13,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1478146621] [2022-04-15 12:02:13,208 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:13,208 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:13,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1855190807, now seen corresponding path program 30 times [2022-04-15 12:02:13,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:13,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350173505] [2022-04-15 12:02:13,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:13,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:13,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:13,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {10069#(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); {10048#true} is VALID [2022-04-15 12:02:13,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-15 12:02:13,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10048#true} {10048#true} #43#return; {10048#true} is VALID [2022-04-15 12:02:13,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {10048#true} call ULTIMATE.init(); {10069#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:13,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {10069#(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); {10048#true} is VALID [2022-04-15 12:02:13,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-15 12:02:13,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10048#true} {10048#true} #43#return; {10048#true} is VALID [2022-04-15 12:02:13,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {10048#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {10048#true} is VALID [2022-04-15 12:02:13,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {10048#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; {10053#(= main_~i~0 0)} is VALID [2022-04-15 12:02:13,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {10053#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10053#(= main_~i~0 0)} is VALID [2022-04-15 12:02:13,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {10053#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10054#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:13,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {10054#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10054#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:13,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {10054#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10055#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:13,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {10055#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10055#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:13,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {10055#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10056#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:13,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {10056#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10056#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:13,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {10056#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10057#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:13,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {10057#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10057#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:13,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {10057#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10058#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:13,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {10058#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10058#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:13,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {10058#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10059#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:13,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {10059#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10059#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:13,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {10059#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10060#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:13,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {10060#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10060#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:13,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {10060#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10061#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:13,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {10061#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10061#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:13,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {10061#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10062#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:13,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {10062#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10062#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:13,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {10062#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10063#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:13,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {10063#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10063#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:13,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {10063#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10064#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:13,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {10064#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10064#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:13,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {10064#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10065#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:13,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {10065#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10065#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:13,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {10065#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10066#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:13,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {10066#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10066#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:13,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {10066#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10067#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:02:13,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {10067#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10067#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:02:13,506 INFO L290 TraceCheckUtils]: 35: Hoare triple {10067#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10068#(and (<= main_~i~0 15) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:02:13,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {10068#(and (<= main_~i~0 15) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {10049#false} is VALID [2022-04-15 12:02:13,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {10049#false} ~i~0 := 0; {10049#false} is VALID [2022-04-15 12:02:13,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:13,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:13,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:13,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:13,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:13,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:13,507 INFO L290 TraceCheckUtils]: 44: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:13,507 INFO L290 TraceCheckUtils]: 45: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:13,508 INFO L290 TraceCheckUtils]: 46: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:13,508 INFO L290 TraceCheckUtils]: 47: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:13,508 INFO L290 TraceCheckUtils]: 48: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:13,508 INFO L290 TraceCheckUtils]: 49: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:13,508 INFO L290 TraceCheckUtils]: 50: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:13,508 INFO L290 TraceCheckUtils]: 51: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:13,508 INFO L290 TraceCheckUtils]: 52: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:13,508 INFO L290 TraceCheckUtils]: 53: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:13,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:13,508 INFO L290 TraceCheckUtils]: 55: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:13,508 INFO L290 TraceCheckUtils]: 56: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:13,508 INFO L290 TraceCheckUtils]: 57: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:13,508 INFO L290 TraceCheckUtils]: 58: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:13,509 INFO L290 TraceCheckUtils]: 59: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:13,509 INFO L290 TraceCheckUtils]: 60: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:13,509 INFO L290 TraceCheckUtils]: 61: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:13,509 INFO L290 TraceCheckUtils]: 62: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:13,509 INFO L290 TraceCheckUtils]: 63: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:13,509 INFO L290 TraceCheckUtils]: 64: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:13,509 INFO L290 TraceCheckUtils]: 65: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:13,509 INFO L290 TraceCheckUtils]: 66: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:13,509 INFO L290 TraceCheckUtils]: 67: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:13,509 INFO L290 TraceCheckUtils]: 68: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:13,509 INFO L290 TraceCheckUtils]: 69: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:13,509 INFO L290 TraceCheckUtils]: 70: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:13,509 INFO L290 TraceCheckUtils]: 71: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:13,509 INFO L290 TraceCheckUtils]: 72: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:13,510 INFO L290 TraceCheckUtils]: 73: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:13,510 INFO L290 TraceCheckUtils]: 74: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:13,510 INFO L290 TraceCheckUtils]: 75: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:13,510 INFO L290 TraceCheckUtils]: 76: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:13,510 INFO L290 TraceCheckUtils]: 77: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:13,510 INFO L290 TraceCheckUtils]: 78: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:13,510 INFO L290 TraceCheckUtils]: 79: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:13,510 INFO L290 TraceCheckUtils]: 80: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:13,510 INFO L290 TraceCheckUtils]: 81: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:13,510 INFO L290 TraceCheckUtils]: 82: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:13,510 INFO L290 TraceCheckUtils]: 83: Hoare triple {10049#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {10049#false} is VALID [2022-04-15 12:02:13,510 INFO L290 TraceCheckUtils]: 84: Hoare triple {10049#false} assume !false; {10049#false} is VALID [2022-04-15 12:02:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2022-04-15 12:02:13,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:13,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350173505] [2022-04-15 12:02:13,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350173505] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:13,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564236416] [2022-04-15 12:02:13,511 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:02:13,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:13,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:13,528 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:13,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 12:02:30,121 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-15 12:02:30,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:30,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 12:02:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:30,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:30,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {10048#true} call ULTIMATE.init(); {10048#true} is VALID [2022-04-15 12:02:30,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {10048#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); {10048#true} is VALID [2022-04-15 12:02:30,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-15 12:02:30,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10048#true} {10048#true} #43#return; {10048#true} is VALID [2022-04-15 12:02:30,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {10048#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {10048#true} is VALID [2022-04-15 12:02:30,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {10048#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; {10053#(= main_~i~0 0)} is VALID [2022-04-15 12:02:30,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {10053#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10053#(= main_~i~0 0)} is VALID [2022-04-15 12:02:30,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {10053#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10054#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:30,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {10054#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10054#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:30,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {10054#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10055#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:30,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {10055#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10055#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:30,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {10055#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10056#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:30,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {10056#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10056#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:30,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {10056#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10057#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:30,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {10057#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10057#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:30,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {10057#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10058#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:30,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {10058#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10058#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:30,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {10058#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10059#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:30,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {10059#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10059#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:30,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {10059#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10060#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:30,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {10060#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10060#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:30,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {10060#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10061#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:30,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {10061#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10061#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:30,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {10061#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10062#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:30,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {10062#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10062#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:30,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {10062#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10063#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:30,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {10063#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10063#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:30,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {10063#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10064#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:30,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {10064#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10064#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:30,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {10064#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10065#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:30,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {10065#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10065#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:30,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {10065#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10066#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:30,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {10066#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10066#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:30,589 INFO L290 TraceCheckUtils]: 33: Hoare triple {10066#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10067#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:02:30,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {10067#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10067#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:02:30,590 INFO L290 TraceCheckUtils]: 35: Hoare triple {10067#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10178#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:02:30,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {10178#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {10049#false} is VALID [2022-04-15 12:02:30,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {10049#false} ~i~0 := 0; {10049#false} is VALID [2022-04-15 12:02:30,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:30,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:30,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 41: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 42: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 45: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 46: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 47: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 50: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 51: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 52: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 53: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 54: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 55: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 56: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 57: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:30,591 INFO L290 TraceCheckUtils]: 58: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 59: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 60: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 61: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 62: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 63: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 64: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 65: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 66: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 67: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 68: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 69: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 70: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 71: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 72: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 73: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 74: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:30,592 INFO L290 TraceCheckUtils]: 75: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:30,593 INFO L290 TraceCheckUtils]: 76: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:30,593 INFO L290 TraceCheckUtils]: 77: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:30,593 INFO L290 TraceCheckUtils]: 78: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:30,593 INFO L290 TraceCheckUtils]: 79: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:30,593 INFO L290 TraceCheckUtils]: 80: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:30,593 INFO L290 TraceCheckUtils]: 81: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:30,593 INFO L290 TraceCheckUtils]: 82: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:30,593 INFO L290 TraceCheckUtils]: 83: Hoare triple {10049#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {10049#false} is VALID [2022-04-15 12:02:30,593 INFO L290 TraceCheckUtils]: 84: Hoare triple {10049#false} assume !false; {10049#false} is VALID [2022-04-15 12:02:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2022-04-15 12:02:30,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:31,263 INFO L290 TraceCheckUtils]: 84: Hoare triple {10049#false} assume !false; {10049#false} is VALID [2022-04-15 12:02:31,263 INFO L290 TraceCheckUtils]: 83: Hoare triple {10049#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {10049#false} is VALID [2022-04-15 12:02:31,263 INFO L290 TraceCheckUtils]: 82: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:31,263 INFO L290 TraceCheckUtils]: 81: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:31,263 INFO L290 TraceCheckUtils]: 80: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:31,263 INFO L290 TraceCheckUtils]: 79: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 78: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 77: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 76: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 75: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 74: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 73: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 72: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 71: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 70: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 69: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 68: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 67: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 66: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 65: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 64: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 63: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 62: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:31,264 INFO L290 TraceCheckUtils]: 61: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 60: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 59: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 58: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 57: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 56: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 55: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 54: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 53: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 52: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 51: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 50: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 49: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 47: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 46: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:31,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:31,266 INFO L290 TraceCheckUtils]: 42: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:31,266 INFO L290 TraceCheckUtils]: 41: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:31,266 INFO L290 TraceCheckUtils]: 40: Hoare triple {10049#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10049#false} is VALID [2022-04-15 12:02:31,266 INFO L290 TraceCheckUtils]: 39: Hoare triple {10049#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {10049#false} is VALID [2022-04-15 12:02:31,266 INFO L290 TraceCheckUtils]: 38: Hoare triple {10049#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-15 12:02:31,266 INFO L290 TraceCheckUtils]: 37: Hoare triple {10049#false} ~i~0 := 0; {10049#false} is VALID [2022-04-15 12:02:31,266 INFO L290 TraceCheckUtils]: 36: Hoare triple {10470#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {10049#false} is VALID [2022-04-15 12:02:31,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {10474#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10470#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:02:31,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {10474#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10474#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {10481#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10474#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {10481#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10481#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {10488#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10481#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {10488#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10488#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {10495#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10488#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {10495#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10495#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {10502#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10495#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {10502#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10502#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {10509#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10502#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {10509#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10509#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {10516#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10509#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {10516#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10516#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {10523#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10516#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {10523#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10523#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {10530#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10523#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {10530#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10530#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {10537#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10530#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {10537#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10537#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {10544#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10537#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {10544#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10544#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {10551#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10544#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {10551#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10551#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {10558#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10551#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {10558#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10558#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {10565#(< (mod (+ main_~i~0 14) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10558#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {10565#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10565#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {10572#(< (mod (+ main_~i~0 15) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10565#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {10572#(< (mod (+ main_~i~0 15) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {10572#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {10048#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; {10572#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 12:02:31,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {10048#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {10048#true} is VALID [2022-04-15 12:02:31,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10048#true} {10048#true} #43#return; {10048#true} is VALID [2022-04-15 12:02:31,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-15 12:02:31,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {10048#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); {10048#true} is VALID [2022-04-15 12:02:31,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {10048#true} call ULTIMATE.init(); {10048#true} is VALID [2022-04-15 12:02:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2022-04-15 12:02:31,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564236416] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:31,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:31,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-15 12:02:31,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:31,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1478146621] [2022-04-15 12:02:31,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1478146621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:31,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:31,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:02:31,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893991747] [2022-04-15 12:02:31,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:31,281 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-15 12:02:31,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:31,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:31,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:31,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:02:31,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:31,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:02:31,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=903, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:02:31,326 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:32,840 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2022-04-15 12:02:32,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:02:32,840 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-15 12:02:32,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 103 transitions. [2022-04-15 12:02:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 103 transitions. [2022-04-15 12:02:32,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 103 transitions. [2022-04-15 12:02:32,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:32,923 INFO L225 Difference]: With dead ends: 143 [2022-04-15 12:02:32,923 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 12:02:32,924 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=954, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:02:32,924 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 54 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:32,924 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 302 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:02:32,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 12:02:33,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-15 12:02:33,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:33,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,002 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,002 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:33,003 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-04-15 12:02:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2022-04-15 12:02:33,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:33,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:33,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-15 12:02:33,004 INFO L87 Difference]: Start difference. First operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-15 12:02:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:33,005 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-04-15 12:02:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2022-04-15 12:02:33,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:33,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:33,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:33,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2022-04-15 12:02:33,006 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 85 [2022-04-15 12:02:33,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:33,006 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2022-04-15 12:02:33,007 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:33,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 92 transitions. [2022-04-15 12:02:33,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:33,072 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2022-04-15 12:02:33,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-15 12:02:33,072 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:33,073 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:33,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-15 12:02:33,280 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 12:02:33,281 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:33,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:33,281 INFO L85 PathProgramCache]: Analyzing trace with hash 741309552, now seen corresponding path program 31 times [2022-04-15 12:02:33,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:33,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [974684477] [2022-04-15 12:02:33,285 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:33,285 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:33,285 INFO L85 PathProgramCache]: Analyzing trace with hash 741309552, now seen corresponding path program 32 times [2022-04-15 12:02:33,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:33,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126104243] [2022-04-15 12:02:33,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:33,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:33,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:33,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {11276#(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); {11254#true} is VALID [2022-04-15 12:02:33,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {11254#true} assume true; {11254#true} is VALID [2022-04-15 12:02:33,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11254#true} {11254#true} #43#return; {11254#true} is VALID [2022-04-15 12:02:33,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {11254#true} call ULTIMATE.init(); {11276#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:33,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {11276#(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); {11254#true} is VALID [2022-04-15 12:02:33,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {11254#true} assume true; {11254#true} is VALID [2022-04-15 12:02:33,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11254#true} {11254#true} #43#return; {11254#true} is VALID [2022-04-15 12:02:33,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {11254#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {11254#true} is VALID [2022-04-15 12:02:33,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {11254#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; {11259#(= main_~i~0 0)} is VALID [2022-04-15 12:02:33,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {11259#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11259#(= main_~i~0 0)} is VALID [2022-04-15 12:02:33,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {11259#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:33,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {11260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:33,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {11260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:33,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {11261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:33,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {11261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:33,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {11262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:33,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {11262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:33,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {11263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:33,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {11263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:33,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {11264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:33,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {11264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11265#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:33,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {11265#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11265#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:33,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {11265#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11266#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:33,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {11266#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11266#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:33,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {11266#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11267#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:33,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {11267#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11267#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:33,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {11267#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11268#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:33,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {11268#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11268#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:33,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {11268#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11269#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:33,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {11269#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11269#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:33,591 INFO L290 TraceCheckUtils]: 27: Hoare triple {11269#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11270#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:33,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {11270#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11270#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:33,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {11270#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11271#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:33,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {11271#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11271#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:33,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {11271#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11272#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:33,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {11272#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11272#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:33,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {11272#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11273#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:02:33,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {11273#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11273#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:02:33,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {11273#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11274#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:02:33,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {11274#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11274#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:02:33,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {11274#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11275#(and (<= main_~i~0 16) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:02:33,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {11275#(and (<= main_~i~0 16) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {11255#false} is VALID [2022-04-15 12:02:33,596 INFO L290 TraceCheckUtils]: 39: Hoare triple {11255#false} ~i~0 := 0; {11255#false} is VALID [2022-04-15 12:02:33,596 INFO L290 TraceCheckUtils]: 40: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:33,596 INFO L290 TraceCheckUtils]: 41: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:33,596 INFO L290 TraceCheckUtils]: 42: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:33,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:33,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:33,596 INFO L290 TraceCheckUtils]: 45: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:33,596 INFO L290 TraceCheckUtils]: 46: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:33,596 INFO L290 TraceCheckUtils]: 47: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:33,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:33,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:33,596 INFO L290 TraceCheckUtils]: 50: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:33,596 INFO L290 TraceCheckUtils]: 51: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:33,596 INFO L290 TraceCheckUtils]: 52: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 53: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 54: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 55: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 56: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 57: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 58: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 59: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 60: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 61: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 62: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 63: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 64: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 65: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 66: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 67: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 68: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 69: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:33,597 INFO L290 TraceCheckUtils]: 70: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 71: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 72: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 73: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 74: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 75: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 76: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 77: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 78: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 79: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 80: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 81: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 82: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 83: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 84: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 85: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 86: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 87: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 88: Hoare triple {11255#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {11255#false} is VALID [2022-04-15 12:02:33,598 INFO L290 TraceCheckUtils]: 89: Hoare triple {11255#false} assume !false; {11255#false} is VALID [2022-04-15 12:02:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2022-04-15 12:02:33,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:33,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126104243] [2022-04-15 12:02:33,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126104243] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:33,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536648889] [2022-04-15 12:02:33,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:02:33,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:33,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:33,600 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:33,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 12:02:33,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:02:33,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:33,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 12:02:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:33,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:34,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {11254#true} call ULTIMATE.init(); {11254#true} is VALID [2022-04-15 12:02:34,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {11254#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); {11254#true} is VALID [2022-04-15 12:02:34,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {11254#true} assume true; {11254#true} is VALID [2022-04-15 12:02:34,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11254#true} {11254#true} #43#return; {11254#true} is VALID [2022-04-15 12:02:34,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {11254#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {11254#true} is VALID [2022-04-15 12:02:34,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {11254#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; {11259#(= main_~i~0 0)} is VALID [2022-04-15 12:02:34,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {11259#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11259#(= main_~i~0 0)} is VALID [2022-04-15 12:02:34,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {11259#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:34,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {11260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:34,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {11260#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:34,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {11261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:34,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {11261#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:34,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {11262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:34,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {11262#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:34,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {11263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:34,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {11263#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:34,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {11264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:34,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {11264#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11265#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:34,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {11265#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11265#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:34,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {11265#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11266#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:34,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {11266#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11266#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:34,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {11266#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11267#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:34,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {11267#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11267#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:34,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {11267#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11268#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:34,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {11268#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11268#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:34,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {11268#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11269#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:34,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {11269#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11269#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:34,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {11269#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11270#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:34,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {11270#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11270#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:34,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {11270#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11271#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:34,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {11271#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11271#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:34,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {11271#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11272#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:34,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {11272#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11272#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:34,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {11272#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11273#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:02:34,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {11273#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11273#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:02:34,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {11273#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11274#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:02:34,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {11274#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11274#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:02:34,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {11274#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11391#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:02:34,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {11391#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 39: Hoare triple {11255#false} ~i~0 := 0; {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 47: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 52: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 55: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:34,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 57: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 58: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 59: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 60: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 61: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 62: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 63: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 64: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 65: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 66: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 67: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 68: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 69: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 70: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 71: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 72: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:34,370 INFO L290 TraceCheckUtils]: 73: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:34,371 INFO L290 TraceCheckUtils]: 74: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:34,371 INFO L290 TraceCheckUtils]: 75: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:34,371 INFO L290 TraceCheckUtils]: 76: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:34,371 INFO L290 TraceCheckUtils]: 77: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:34,371 INFO L290 TraceCheckUtils]: 78: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:34,371 INFO L290 TraceCheckUtils]: 79: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:34,371 INFO L290 TraceCheckUtils]: 80: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:34,371 INFO L290 TraceCheckUtils]: 81: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:34,371 INFO L290 TraceCheckUtils]: 82: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:34,371 INFO L290 TraceCheckUtils]: 83: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:34,371 INFO L290 TraceCheckUtils]: 84: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:34,371 INFO L290 TraceCheckUtils]: 85: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:34,371 INFO L290 TraceCheckUtils]: 86: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:34,371 INFO L290 TraceCheckUtils]: 87: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:34,371 INFO L290 TraceCheckUtils]: 88: Hoare triple {11255#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {11255#false} is VALID [2022-04-15 12:02:34,371 INFO L290 TraceCheckUtils]: 89: Hoare triple {11255#false} assume !false; {11255#false} is VALID [2022-04-15 12:02:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2022-04-15 12:02:34,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:35,092 INFO L290 TraceCheckUtils]: 89: Hoare triple {11255#false} assume !false; {11255#false} is VALID [2022-04-15 12:02:35,092 INFO L290 TraceCheckUtils]: 88: Hoare triple {11255#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {11255#false} is VALID [2022-04-15 12:02:35,092 INFO L290 TraceCheckUtils]: 87: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:35,092 INFO L290 TraceCheckUtils]: 86: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:35,092 INFO L290 TraceCheckUtils]: 85: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 84: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 83: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 82: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 81: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 80: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 79: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 78: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 77: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 76: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 75: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 74: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 73: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 72: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 71: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 70: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 69: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 68: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:35,093 INFO L290 TraceCheckUtils]: 67: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 66: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 62: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 59: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 56: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 55: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 54: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 53: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 52: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 51: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 50: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:35,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:35,095 INFO L290 TraceCheckUtils]: 48: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:35,095 INFO L290 TraceCheckUtils]: 47: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:35,095 INFO L290 TraceCheckUtils]: 46: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:35,095 INFO L290 TraceCheckUtils]: 45: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:35,095 INFO L290 TraceCheckUtils]: 44: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:35,095 INFO L290 TraceCheckUtils]: 43: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:35,095 INFO L290 TraceCheckUtils]: 42: Hoare triple {11255#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11255#false} is VALID [2022-04-15 12:02:35,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {11255#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {11255#false} is VALID [2022-04-15 12:02:35,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {11255#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {11255#false} is VALID [2022-04-15 12:02:35,095 INFO L290 TraceCheckUtils]: 39: Hoare triple {11255#false} ~i~0 := 0; {11255#false} is VALID [2022-04-15 12:02:35,095 INFO L290 TraceCheckUtils]: 38: Hoare triple {11701#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {11255#false} is VALID [2022-04-15 12:02:35,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {11705#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11701#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:02:35,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {11705#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11705#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {11712#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11705#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {11712#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11712#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {11719#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11712#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {11719#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11719#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {11726#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11719#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {11726#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11726#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {11733#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11726#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {11733#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11733#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {11740#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11733#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {11740#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11740#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {11747#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11740#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {11747#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11747#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {11754#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11747#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {11754#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11754#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {11761#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11754#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {11761#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11761#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {11768#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11761#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {11768#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11768#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {11775#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11768#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {11775#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11775#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {11782#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11775#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {11782#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11782#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {11789#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11782#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {11789#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11789#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {11796#(< (mod (+ main_~i~0 14) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11789#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {11796#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11796#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {11803#(< (mod (+ main_~i~0 15) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11796#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {11803#(< (mod (+ main_~i~0 15) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11803#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {11810#(< (mod (+ main_~i~0 16) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11803#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {11810#(< (mod (+ main_~i~0 16) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {11810#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {11254#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; {11810#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 12:02:35,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {11254#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {11254#true} is VALID [2022-04-15 12:02:35,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11254#true} {11254#true} #43#return; {11254#true} is VALID [2022-04-15 12:02:35,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {11254#true} assume true; {11254#true} is VALID [2022-04-15 12:02:35,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {11254#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); {11254#true} is VALID [2022-04-15 12:02:35,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {11254#true} call ULTIMATE.init(); {11254#true} is VALID [2022-04-15 12:02:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2022-04-15 12:02:35,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536648889] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:35,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:35,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-15 12:02:35,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:35,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [974684477] [2022-04-15 12:02:35,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [974684477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:35,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:35,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:02:35,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441019639] [2022-04-15 12:02:35,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:35,111 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-15 12:02:35,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:35,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:35,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:35,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:02:35,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:35,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:02:35,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1010, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:02:35,146 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:36,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:36,804 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2022-04-15 12:02:36,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:02:36,804 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-15 12:02:36,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 108 transitions. [2022-04-15 12:02:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 108 transitions. [2022-04-15 12:02:36,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 108 transitions. [2022-04-15 12:02:36,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:36,881 INFO L225 Difference]: With dead ends: 151 [2022-04-15 12:02:36,881 INFO L226 Difference]: Without dead ends: 99 [2022-04-15 12:02:36,881 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=418, Invalid=1064, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:02:36,882 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 81 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:36,882 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 278 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 12:02:36,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-15 12:02:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2022-04-15 12:02:36,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:36,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:36,963 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:36,963 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:36,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:36,964 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2022-04-15 12:02:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-04-15 12:02:36,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:36,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:36,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-15 12:02:36,965 INFO L87 Difference]: Start difference. First operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-15 12:02:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:36,966 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2022-04-15 12:02:36,966 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-04-15 12:02:36,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:36,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:36,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:36,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:36,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:36,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2022-04-15 12:02:36,967 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 90 [2022-04-15 12:02:36,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:36,968 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2022-04-15 12:02:36,968 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:36,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 97 transitions. [2022-04-15 12:02:37,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2022-04-15 12:02:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 12:02:37,036 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:37,036 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:37,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:37,237 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 12:02:37,237 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:37,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1721038853, now seen corresponding path program 33 times [2022-04-15 12:02:37,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:37,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1396213736] [2022-04-15 12:02:37,242 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:37,242 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:37,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1721038853, now seen corresponding path program 34 times [2022-04-15 12:02:37,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:37,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651237379] [2022-04-15 12:02:37,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:37,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:37,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:37,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {12551#(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); {12528#true} is VALID [2022-04-15 12:02:37,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {12528#true} assume true; {12528#true} is VALID [2022-04-15 12:02:37,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12528#true} {12528#true} #43#return; {12528#true} is VALID [2022-04-15 12:02:37,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {12528#true} call ULTIMATE.init(); {12551#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:37,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {12551#(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); {12528#true} is VALID [2022-04-15 12:02:37,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {12528#true} assume true; {12528#true} is VALID [2022-04-15 12:02:37,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12528#true} {12528#true} #43#return; {12528#true} is VALID [2022-04-15 12:02:37,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {12528#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {12528#true} is VALID [2022-04-15 12:02:37,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {12528#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; {12533#(= main_~i~0 0)} is VALID [2022-04-15 12:02:37,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {12533#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12533#(= main_~i~0 0)} is VALID [2022-04-15 12:02:37,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {12533#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12534#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:37,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {12534#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12534#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:37,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {12534#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12535#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:37,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {12535#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12535#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:37,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {12535#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12536#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:37,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {12536#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12536#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:37,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {12536#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12537#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:37,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {12537#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12537#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:37,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {12537#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12538#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:37,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {12538#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12538#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:37,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {12538#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12539#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:37,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {12539#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12539#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:37,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {12539#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12540#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:37,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {12540#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12540#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:37,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {12540#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12541#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:37,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {12541#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12541#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:37,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {12541#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12542#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:37,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {12542#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12542#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:37,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {12542#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12543#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:37,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {12543#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12543#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:37,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {12543#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12544#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:37,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {12544#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12544#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:37,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {12544#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12545#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:37,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {12545#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12545#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:37,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {12545#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12546#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:37,570 INFO L290 TraceCheckUtils]: 32: Hoare triple {12546#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12546#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:37,570 INFO L290 TraceCheckUtils]: 33: Hoare triple {12546#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12547#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:02:37,570 INFO L290 TraceCheckUtils]: 34: Hoare triple {12547#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12547#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:02:37,571 INFO L290 TraceCheckUtils]: 35: Hoare triple {12547#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12548#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:02:37,571 INFO L290 TraceCheckUtils]: 36: Hoare triple {12548#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12548#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:02:37,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {12548#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12549#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:02:37,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {12549#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12549#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:02:37,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {12549#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12550#(and (<= main_~i~0 17) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:02:37,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {12550#(and (<= main_~i~0 17) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {12529#false} is VALID [2022-04-15 12:02:37,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {12529#false} ~i~0 := 0; {12529#false} is VALID [2022-04-15 12:02:37,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,573 INFO L290 TraceCheckUtils]: 50: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 51: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 52: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 53: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 54: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 55: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 56: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 57: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 58: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 59: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 60: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 61: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 62: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 63: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 64: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 65: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 66: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 67: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 68: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,574 INFO L290 TraceCheckUtils]: 69: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 70: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 71: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 72: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 73: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 74: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 75: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 76: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 77: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 78: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 79: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 80: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 81: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 82: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 83: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 84: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 85: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 86: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 87: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,575 INFO L290 TraceCheckUtils]: 88: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,576 INFO L290 TraceCheckUtils]: 89: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,576 INFO L290 TraceCheckUtils]: 90: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:37,576 INFO L290 TraceCheckUtils]: 91: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:37,576 INFO L290 TraceCheckUtils]: 92: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:37,576 INFO L290 TraceCheckUtils]: 93: Hoare triple {12529#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {12529#false} is VALID [2022-04-15 12:02:37,576 INFO L290 TraceCheckUtils]: 94: Hoare triple {12529#false} assume !false; {12529#false} is VALID [2022-04-15 12:02:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-04-15 12:02:37,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:37,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651237379] [2022-04-15 12:02:37,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651237379] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:37,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493082652] [2022-04-15 12:02:37,577 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:02:37,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:37,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:37,578 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:37,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 12:02:38,004 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:02:38,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:38,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 12:02:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:38,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:38,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {12528#true} call ULTIMATE.init(); {12528#true} is VALID [2022-04-15 12:02:38,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {12528#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); {12528#true} is VALID [2022-04-15 12:02:38,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {12528#true} assume true; {12528#true} is VALID [2022-04-15 12:02:38,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12528#true} {12528#true} #43#return; {12528#true} is VALID [2022-04-15 12:02:38,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {12528#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {12528#true} is VALID [2022-04-15 12:02:38,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {12528#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; {12533#(= main_~i~0 0)} is VALID [2022-04-15 12:02:38,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {12533#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12533#(= main_~i~0 0)} is VALID [2022-04-15 12:02:38,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {12533#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12534#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:38,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {12534#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12534#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:38,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {12534#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12535#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:38,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {12535#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12535#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:38,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {12535#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12536#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:38,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {12536#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12536#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:38,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {12536#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12537#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:38,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {12537#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12537#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:38,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {12537#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12538#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:38,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {12538#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12538#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:38,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {12538#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12539#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:38,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {12539#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12539#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:38,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {12539#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12540#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:38,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {12540#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12540#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:38,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {12540#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12541#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:38,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {12541#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12541#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:38,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {12541#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12542#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:38,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {12542#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12542#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:38,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {12542#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12543#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:38,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {12543#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12543#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:38,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {12543#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12544#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:38,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {12544#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12544#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:38,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {12544#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12545#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:38,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {12545#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12545#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:38,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {12545#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12546#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:38,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {12546#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12546#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:38,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {12546#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12547#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:02:38,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {12547#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12547#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:02:38,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {12547#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12548#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:02:38,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {12548#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12548#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:02:38,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {12548#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12549#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:02:38,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {12549#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {12549#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:02:38,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {12549#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12672#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:02:38,479 INFO L290 TraceCheckUtils]: 40: Hoare triple {12672#(and (<= 17 main_~i~0) (<= main_~i~0 17))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {12529#false} is VALID [2022-04-15 12:02:38,479 INFO L290 TraceCheckUtils]: 41: Hoare triple {12529#false} ~i~0 := 0; {12529#false} is VALID [2022-04-15 12:02:38,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,479 INFO L290 TraceCheckUtils]: 43: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,479 INFO L290 TraceCheckUtils]: 44: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,479 INFO L290 TraceCheckUtils]: 45: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,479 INFO L290 TraceCheckUtils]: 46: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,479 INFO L290 TraceCheckUtils]: 47: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,479 INFO L290 TraceCheckUtils]: 48: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,479 INFO L290 TraceCheckUtils]: 50: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,479 INFO L290 TraceCheckUtils]: 51: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,479 INFO L290 TraceCheckUtils]: 52: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,479 INFO L290 TraceCheckUtils]: 53: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,479 INFO L290 TraceCheckUtils]: 54: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,479 INFO L290 TraceCheckUtils]: 55: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 56: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 57: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 58: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 59: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 60: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 61: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 62: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 63: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 64: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 65: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 66: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 67: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 68: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 69: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 70: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 71: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 72: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,480 INFO L290 TraceCheckUtils]: 73: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 74: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 75: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 76: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 77: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 78: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 79: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 80: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 81: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 82: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 83: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 84: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 85: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 86: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 87: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 88: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 89: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 90: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 91: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:38,481 INFO L290 TraceCheckUtils]: 92: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:38,482 INFO L290 TraceCheckUtils]: 93: Hoare triple {12529#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {12529#false} is VALID [2022-04-15 12:02:38,482 INFO L290 TraceCheckUtils]: 94: Hoare triple {12529#false} assume !false; {12529#false} is VALID [2022-04-15 12:02:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-04-15 12:02:38,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:39,213 INFO L290 TraceCheckUtils]: 94: Hoare triple {12529#false} assume !false; {12529#false} is VALID [2022-04-15 12:02:39,213 INFO L290 TraceCheckUtils]: 93: Hoare triple {12529#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {12529#false} is VALID [2022-04-15 12:02:39,213 INFO L290 TraceCheckUtils]: 92: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,213 INFO L290 TraceCheckUtils]: 91: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,213 INFO L290 TraceCheckUtils]: 90: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,213 INFO L290 TraceCheckUtils]: 89: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,213 INFO L290 TraceCheckUtils]: 88: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,213 INFO L290 TraceCheckUtils]: 87: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,213 INFO L290 TraceCheckUtils]: 86: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 85: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 84: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 83: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 82: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 81: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 80: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 79: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 78: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 77: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 76: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 75: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 74: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 73: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 72: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 71: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 70: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 69: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 68: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,214 INFO L290 TraceCheckUtils]: 67: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 66: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 65: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 64: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 63: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 62: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 61: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 60: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 59: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 57: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 56: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 55: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 54: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 53: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 52: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 51: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,216 INFO L290 TraceCheckUtils]: 48: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,216 INFO L290 TraceCheckUtils]: 47: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,216 INFO L290 TraceCheckUtils]: 46: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,216 INFO L290 TraceCheckUtils]: 45: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {12529#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12529#false} is VALID [2022-04-15 12:02:39,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {12529#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {12529#false} is VALID [2022-04-15 12:02:39,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {12529#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {12529#false} is VALID [2022-04-15 12:02:39,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {12529#false} ~i~0 := 0; {12529#false} is VALID [2022-04-15 12:02:39,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {13000#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {12529#false} is VALID [2022-04-15 12:02:39,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {13004#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13000#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:02:39,217 INFO L290 TraceCheckUtils]: 38: Hoare triple {13004#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13004#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,218 INFO L290 TraceCheckUtils]: 37: Hoare triple {13011#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13004#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,218 INFO L290 TraceCheckUtils]: 36: Hoare triple {13011#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13011#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,218 INFO L290 TraceCheckUtils]: 35: Hoare triple {13018#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13011#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {13018#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13018#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {13025#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13018#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {13025#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13025#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {13032#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13025#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {13032#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13032#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {13039#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13032#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {13039#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13039#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {13046#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13039#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {13046#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13046#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {13053#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13046#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {13053#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13053#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {13060#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13053#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {13060#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13060#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {13067#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13060#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {13067#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13067#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {13074#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13067#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {13074#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13074#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {13081#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13074#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {13081#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13081#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {13088#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13081#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {13088#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13088#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {13095#(< (mod (+ main_~i~0 14) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13088#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {13095#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13095#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {13102#(< (mod (+ main_~i~0 15) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13095#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {13102#(< (mod (+ main_~i~0 15) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13102#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {13109#(< (mod (+ main_~i~0 16) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13102#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {13109#(< (mod (+ main_~i~0 16) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13109#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {13116#(< (mod (+ main_~i~0 17) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13109#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {13116#(< (mod (+ main_~i~0 17) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13116#(< (mod (+ main_~i~0 17) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {12528#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; {13116#(< (mod (+ main_~i~0 17) 4294967296) 102400)} is VALID [2022-04-15 12:02:39,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {12528#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {12528#true} is VALID [2022-04-15 12:02:39,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12528#true} {12528#true} #43#return; {12528#true} is VALID [2022-04-15 12:02:39,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {12528#true} assume true; {12528#true} is VALID [2022-04-15 12:02:39,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {12528#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); {12528#true} is VALID [2022-04-15 12:02:39,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {12528#true} call ULTIMATE.init(); {12528#true} is VALID [2022-04-15 12:02:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-04-15 12:02:39,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493082652] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:39,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:02:39,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-15 12:02:39,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:39,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1396213736] [2022-04-15 12:02:39,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1396213736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:39,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:39,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:02:39,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132590695] [2022-04-15 12:02:39,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:39,233 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-15 12:02:39,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:39,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:39,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:39,267 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:02:39,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:39,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:02:39,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1123, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:02:39,268 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:41,119 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2022-04-15 12:02:41,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:02:41,120 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-15 12:02:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:41,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:41,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 113 transitions. [2022-04-15 12:02:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 113 transitions. [2022-04-15 12:02:41,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 113 transitions. [2022-04-15 12:02:41,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:41,495 INFO L225 Difference]: With dead ends: 159 [2022-04-15 12:02:41,495 INFO L226 Difference]: Without dead ends: 104 [2022-04-15 12:02:41,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=460, Invalid=1180, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:02:41,496 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 78 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:41,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 331 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:02:41,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-15 12:02:41,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2022-04-15 12:02:41,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:41,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:41,589 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:41,589 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:41,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:41,591 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-04-15 12:02:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-04-15 12:02:41,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:41,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:41,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 104 states. [2022-04-15 12:02:41,591 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 104 states. [2022-04-15 12:02:41,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:41,592 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-04-15 12:02:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-04-15 12:02:41,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:41,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:41,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:41,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2022-04-15 12:02:41,597 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 95 [2022-04-15 12:02:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:41,597 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2022-04-15 12:02:41,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:41,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 102 transitions. [2022-04-15 12:02:41,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-04-15 12:02:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-15 12:02:41,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:41,675 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:41,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:41,888 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:41,889 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:41,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:41,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1469568340, now seen corresponding path program 35 times [2022-04-15 12:02:41,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:41,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [856459412] [2022-04-15 12:02:41,893 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:41,893 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1469568340, now seen corresponding path program 36 times [2022-04-15 12:02:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:41,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153479889] [2022-04-15 12:02:41,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:41,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:42,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:42,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {13894#(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); {13870#true} is VALID [2022-04-15 12:02:42,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {13870#true} assume true; {13870#true} is VALID [2022-04-15 12:02:42,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13870#true} {13870#true} #43#return; {13870#true} is VALID [2022-04-15 12:02:42,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {13870#true} call ULTIMATE.init(); {13894#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:42,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {13894#(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); {13870#true} is VALID [2022-04-15 12:02:42,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {13870#true} assume true; {13870#true} is VALID [2022-04-15 12:02:42,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13870#true} {13870#true} #43#return; {13870#true} is VALID [2022-04-15 12:02:42,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {13870#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {13870#true} is VALID [2022-04-15 12:02:42,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {13870#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; {13875#(= main_~i~0 0)} is VALID [2022-04-15 12:02:42,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {13875#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13875#(= main_~i~0 0)} is VALID [2022-04-15 12:02:42,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {13875#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13876#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:42,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {13876#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13876#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:02:42,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {13876#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13877#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:42,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {13877#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13877#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:02:42,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {13877#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13878#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:42,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {13878#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13878#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:02:42,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {13878#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13879#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:42,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {13879#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13879#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:02:42,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {13879#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13880#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:42,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {13880#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13880#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:02:42,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {13880#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13881#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:42,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {13881#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13881#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:02:42,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {13881#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13882#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:42,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {13882#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13882#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:02:42,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {13882#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13883#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:42,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {13883#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13883#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:02:42,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {13883#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13884#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:42,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {13884#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13884#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:02:42,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {13884#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13885#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:42,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {13885#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13885#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:02:42,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {13885#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13886#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:42,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {13886#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13886#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:02:42,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {13886#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13887#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:42,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {13887#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13887#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:02:42,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {13887#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13888#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:42,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {13888#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13888#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:02:42,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {13888#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13889#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:02:42,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {13889#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13889#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:02:42,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {13889#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13890#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:02:42,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {13890#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13890#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:02:42,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {13890#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13891#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:02:42,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {13891#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13891#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:02:42,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {13891#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13892#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:02:42,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {13892#(and (<= 17 main_~i~0) (<= main_~i~0 17))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13892#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:02:42,234 INFO L290 TraceCheckUtils]: 41: Hoare triple {13892#(and (<= 17 main_~i~0) (<= main_~i~0 17))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13893#(and (<= main_~i~0 18) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:02:42,234 INFO L290 TraceCheckUtils]: 42: Hoare triple {13893#(and (<= main_~i~0 18) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {13871#false} is VALID [2022-04-15 12:02:42,234 INFO L290 TraceCheckUtils]: 43: Hoare triple {13871#false} ~i~0 := 0; {13871#false} is VALID [2022-04-15 12:02:42,234 INFO L290 TraceCheckUtils]: 44: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,234 INFO L290 TraceCheckUtils]: 45: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,234 INFO L290 TraceCheckUtils]: 46: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,234 INFO L290 TraceCheckUtils]: 47: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,234 INFO L290 TraceCheckUtils]: 48: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,234 INFO L290 TraceCheckUtils]: 50: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,234 INFO L290 TraceCheckUtils]: 51: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 52: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 53: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 54: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 58: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 59: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 60: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 61: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 62: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 63: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 64: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 65: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 66: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 67: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 68: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,235 INFO L290 TraceCheckUtils]: 69: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 70: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 71: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 72: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 73: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 74: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 75: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 76: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 77: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 78: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 79: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 80: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 81: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 82: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 83: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 84: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 85: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 86: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 87: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,236 INFO L290 TraceCheckUtils]: 88: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,237 INFO L290 TraceCheckUtils]: 89: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,237 INFO L290 TraceCheckUtils]: 90: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,237 INFO L290 TraceCheckUtils]: 91: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,237 INFO L290 TraceCheckUtils]: 92: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,237 INFO L290 TraceCheckUtils]: 93: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,237 INFO L290 TraceCheckUtils]: 94: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,237 INFO L290 TraceCheckUtils]: 95: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:02:42,237 INFO L290 TraceCheckUtils]: 96: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:02:42,237 INFO L290 TraceCheckUtils]: 97: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:02:42,237 INFO L290 TraceCheckUtils]: 98: Hoare triple {13871#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {13871#false} is VALID [2022-04-15 12:02:42,237 INFO L290 TraceCheckUtils]: 99: Hoare triple {13871#false} assume !false; {13871#false} is VALID [2022-04-15 12:02:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2022-04-15 12:02:42,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:42,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153479889] [2022-04-15 12:02:42,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153479889] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:42,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014630177] [2022-04-15 12:02:42,238 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:02:42,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:42,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:42,239 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:42,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 12:09:52,724 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-15 12:09:52,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:09:54,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 12:09:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:09:54,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:09:54,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {13870#true} call ULTIMATE.init(); {13870#true} is VALID [2022-04-15 12:09:54,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {13870#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); {13870#true} is VALID [2022-04-15 12:09:54,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {13870#true} assume true; {13870#true} is VALID [2022-04-15 12:09:54,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13870#true} {13870#true} #43#return; {13870#true} is VALID [2022-04-15 12:09:54,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {13870#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {13870#true} is VALID [2022-04-15 12:09:54,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {13870#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; {13875#(= main_~i~0 0)} is VALID [2022-04-15 12:09:54,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {13875#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13875#(= main_~i~0 0)} is VALID [2022-04-15 12:09:54,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {13875#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13876#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:09:54,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {13876#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13876#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:09:54,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {13876#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13877#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:09:54,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {13877#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13877#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:09:54,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {13877#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13878#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:09:54,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {13878#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13878#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:09:54,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {13878#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13879#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:09:54,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {13879#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13879#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:09:54,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {13879#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13880#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:09:54,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {13880#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13880#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:09:54,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {13880#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13881#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:09:54,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {13881#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13881#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:09:54,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {13881#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13882#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:09:54,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {13882#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13882#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:09:54,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {13882#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13883#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:09:54,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {13883#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13883#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:09:54,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {13883#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13884#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:09:54,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {13884#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13884#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:09:54,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {13884#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13885#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:09:54,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {13885#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13885#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:09:54,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {13885#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13886#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:09:54,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {13886#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13886#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:09:54,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {13886#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13887#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:09:54,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {13887#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13887#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:09:54,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {13887#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13888#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:09:54,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {13888#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13888#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:09:54,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {13888#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13889#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:09:54,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {13889#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13889#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:09:54,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {13889#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13890#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:09:54,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {13890#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13890#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:09:54,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {13890#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13891#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:09:54,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {13891#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13891#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:09:54,583 INFO L290 TraceCheckUtils]: 39: Hoare triple {13891#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13892#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:09:54,583 INFO L290 TraceCheckUtils]: 40: Hoare triple {13892#(and (<= 17 main_~i~0) (<= main_~i~0 17))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {13892#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:09:54,584 INFO L290 TraceCheckUtils]: 41: Hoare triple {13892#(and (<= 17 main_~i~0) (<= main_~i~0 17))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14021#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-15 12:09:54,584 INFO L290 TraceCheckUtils]: 42: Hoare triple {14021#(and (<= main_~i~0 18) (<= 18 main_~i~0))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {13871#false} is VALID [2022-04-15 12:09:54,584 INFO L290 TraceCheckUtils]: 43: Hoare triple {13871#false} ~i~0 := 0; {13871#false} is VALID [2022-04-15 12:09:54,584 INFO L290 TraceCheckUtils]: 44: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 46: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 47: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 48: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 49: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 50: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 51: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 52: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 53: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 54: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 55: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 56: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 57: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 58: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 59: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 60: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 61: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,585 INFO L290 TraceCheckUtils]: 62: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 63: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 64: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 65: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 66: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 67: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 68: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 69: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 70: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 71: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 72: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 73: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 74: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 75: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 76: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 77: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 78: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 79: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 80: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,586 INFO L290 TraceCheckUtils]: 81: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 82: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 83: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 84: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 85: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 86: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 87: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 88: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 89: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 90: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 91: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 92: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 93: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 94: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 95: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 96: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 97: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 98: Hoare triple {13871#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {13871#false} is VALID [2022-04-15 12:09:54,587 INFO L290 TraceCheckUtils]: 99: Hoare triple {13871#false} assume !false; {13871#false} is VALID [2022-04-15 12:09:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2022-04-15 12:09:54,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:09:55,359 INFO L290 TraceCheckUtils]: 99: Hoare triple {13871#false} assume !false; {13871#false} is VALID [2022-04-15 12:09:55,359 INFO L290 TraceCheckUtils]: 98: Hoare triple {13871#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {13871#false} is VALID [2022-04-15 12:09:55,359 INFO L290 TraceCheckUtils]: 97: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,359 INFO L290 TraceCheckUtils]: 96: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,359 INFO L290 TraceCheckUtils]: 95: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,359 INFO L290 TraceCheckUtils]: 94: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 93: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 92: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 91: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 90: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 89: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 88: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 87: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 86: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 85: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 84: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 83: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 82: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 81: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 80: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 79: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 78: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 77: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,360 INFO L290 TraceCheckUtils]: 76: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 75: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 74: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 73: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 72: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 71: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 70: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 69: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 68: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 67: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 66: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 65: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 64: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 63: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 62: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 61: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 60: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 59: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 58: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,361 INFO L290 TraceCheckUtils]: 57: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,362 INFO L290 TraceCheckUtils]: 56: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,362 INFO L290 TraceCheckUtils]: 55: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,362 INFO L290 TraceCheckUtils]: 54: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,362 INFO L290 TraceCheckUtils]: 53: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,362 INFO L290 TraceCheckUtils]: 52: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,362 INFO L290 TraceCheckUtils]: 51: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,362 INFO L290 TraceCheckUtils]: 50: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,362 INFO L290 TraceCheckUtils]: 49: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,362 INFO L290 TraceCheckUtils]: 48: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,362 INFO L290 TraceCheckUtils]: 47: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,362 INFO L290 TraceCheckUtils]: 46: Hoare triple {13871#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13871#false} is VALID [2022-04-15 12:09:55,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {13871#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {13871#false} is VALID [2022-04-15 12:09:55,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {13871#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {13871#false} is VALID [2022-04-15 12:09:55,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {13871#false} ~i~0 := 0; {13871#false} is VALID [2022-04-15 12:09:55,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {14367#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {13871#false} is VALID [2022-04-15 12:09:55,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {14371#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14367#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:09:55,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {14371#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14371#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {14378#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14371#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,364 INFO L290 TraceCheckUtils]: 38: Hoare triple {14378#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14378#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {14385#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14378#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {14385#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14385#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {14392#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14385#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {14392#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14392#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {14399#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14392#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {14399#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14399#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {14406#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14399#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {14406#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14406#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {14413#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14406#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {14413#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14413#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {14420#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14413#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {14420#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14420#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {14427#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14420#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {14427#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14427#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {14434#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14427#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {14434#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14434#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {14441#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14434#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {14441#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14441#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {14448#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14441#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {14448#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14448#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {14455#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14448#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {14455#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14455#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {14462#(< (mod (+ main_~i~0 14) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14455#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {14462#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14462#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {14469#(< (mod (+ main_~i~0 15) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14462#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {14469#(< (mod (+ main_~i~0 15) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14469#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {14476#(< (mod (+ main_~i~0 16) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14469#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {14476#(< (mod (+ main_~i~0 16) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14476#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {14483#(< (mod (+ main_~i~0 17) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14476#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {14483#(< (mod (+ main_~i~0 17) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14483#(< (mod (+ main_~i~0 17) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {14490#(< (mod (+ main_~i~0 18) 4294967296) 102400)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14483#(< (mod (+ main_~i~0 17) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {14490#(< (mod (+ main_~i~0 18) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {14490#(< (mod (+ main_~i~0 18) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {13870#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; {14490#(< (mod (+ main_~i~0 18) 4294967296) 102400)} is VALID [2022-04-15 12:09:55,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {13870#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {13870#true} is VALID [2022-04-15 12:09:55,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13870#true} {13870#true} #43#return; {13870#true} is VALID [2022-04-15 12:09:55,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {13870#true} assume true; {13870#true} is VALID [2022-04-15 12:09:55,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {13870#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); {13870#true} is VALID [2022-04-15 12:09:55,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {13870#true} call ULTIMATE.init(); {13870#true} is VALID [2022-04-15 12:09:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2022-04-15 12:09:55,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014630177] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:09:55,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:09:55,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-15 12:09:55,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:09:55,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [856459412] [2022-04-15 12:09:55,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [856459412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:09:55,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:09:55,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:09:55,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476238583] [2022-04-15 12:09:55,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:09:55,378 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 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 100 [2022-04-15 12:09:55,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:09:55,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:09:55,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:09:55,411 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:09:55,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:09:55,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:09:55,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=1242, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:09:55,412 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:09:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:09:57,318 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2022-04-15 12:09:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:09:57,319 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 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 100 [2022-04-15 12:09:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:09:57,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:09:57,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2022-04-15 12:09:57,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:09:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2022-04-15 12:09:57,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 118 transitions. [2022-04-15 12:09:57,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:09:57,398 INFO L225 Difference]: With dead ends: 167 [2022-04-15 12:09:57,398 INFO L226 Difference]: Without dead ends: 109 [2022-04-15 12:09:57,399 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=504, Invalid=1302, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:09:57,399 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 67 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:09:57,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 406 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:09:57,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-15 12:09:57,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2022-04-15 12:09:57,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:09:57,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 106 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:09:57,483 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 106 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:09:57,483 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 106 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:09:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:09:57,484 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2022-04-15 12:09:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-04-15 12:09:57,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:09:57,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:09:57,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 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 109 states. [2022-04-15 12:09:57,485 INFO L87 Difference]: Start difference. First operand has 106 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 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 109 states. [2022-04-15 12:09:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:09:57,486 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2022-04-15 12:09:57,486 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-04-15 12:09:57,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:09:57,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:09:57,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:09:57,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:09:57,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:09:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2022-04-15 12:09:57,487 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 100 [2022-04-15 12:09:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:09:57,487 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2022-04-15 12:09:57,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:09:57,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 107 transitions. [2022-04-15 12:09:57,559 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-15 12:09:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2022-04-15 12:09:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 12:09:57,559 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:09:57,559 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:09:57,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 12:09:57,760 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:09:57,760 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:09:57,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:09:57,760 INFO L85 PathProgramCache]: Analyzing trace with hash -412170463, now seen corresponding path program 37 times [2022-04-15 12:09:57,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:09:57,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1708254995] [2022-04-15 12:09:57,764 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:09:57,764 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:09:57,764 INFO L85 PathProgramCache]: Analyzing trace with hash -412170463, now seen corresponding path program 38 times [2022-04-15 12:09:57,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:09:57,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797816536] [2022-04-15 12:09:57,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:09:57,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:09:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:09:58,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:09:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:09:58,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {15305#(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); {15280#true} is VALID [2022-04-15 12:09:58,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {15280#true} assume true; {15280#true} is VALID [2022-04-15 12:09:58,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15280#true} {15280#true} #43#return; {15280#true} is VALID [2022-04-15 12:09:58,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {15280#true} call ULTIMATE.init(); {15305#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:09:58,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {15305#(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); {15280#true} is VALID [2022-04-15 12:09:58,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {15280#true} assume true; {15280#true} is VALID [2022-04-15 12:09:58,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15280#true} {15280#true} #43#return; {15280#true} is VALID [2022-04-15 12:09:58,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {15280#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {15280#true} is VALID [2022-04-15 12:09:58,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {15280#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; {15285#(= main_~i~0 0)} is VALID [2022-04-15 12:09:58,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {15285#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15285#(= main_~i~0 0)} is VALID [2022-04-15 12:09:58,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {15285#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15286#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:09:58,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {15286#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15286#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:09:58,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {15286#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15287#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:09:58,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {15287#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15287#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:09:58,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {15287#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15288#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:09:58,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {15288#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15288#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:09:58,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {15288#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15289#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:09:58,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {15289#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15289#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:09:58,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {15289#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15290#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:09:58,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {15290#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15290#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:09:58,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {15290#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15291#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:09:58,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {15291#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15291#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:09:58,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {15291#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15292#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:09:58,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {15292#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15292#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:09:58,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {15292#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15293#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:09:58,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {15293#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15293#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:09:58,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {15293#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15294#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:09:58,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {15294#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15294#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:09:58,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {15294#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15295#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:09:58,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {15295#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15295#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:09:58,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {15295#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15296#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:09:58,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {15296#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15296#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:09:58,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {15296#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15297#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:09:58,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {15297#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15297#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:09:58,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {15297#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15298#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:09:58,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {15298#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15298#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:09:58,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {15298#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15299#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:09:58,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {15299#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15299#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:09:58,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {15299#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15300#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:09:58,148 INFO L290 TraceCheckUtils]: 36: Hoare triple {15300#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15300#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:09:58,148 INFO L290 TraceCheckUtils]: 37: Hoare triple {15300#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15301#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:09:58,148 INFO L290 TraceCheckUtils]: 38: Hoare triple {15301#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15301#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:09:58,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {15301#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15302#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:09:58,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {15302#(and (<= 17 main_~i~0) (<= main_~i~0 17))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15302#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:09:58,149 INFO L290 TraceCheckUtils]: 41: Hoare triple {15302#(and (<= 17 main_~i~0) (<= main_~i~0 17))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15303#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-15 12:09:58,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {15303#(and (<= main_~i~0 18) (<= 18 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15303#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-15 12:09:58,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {15303#(and (<= main_~i~0 18) (<= 18 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15304#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 19))} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {15304#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 19))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {15281#false} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 45: Hoare triple {15281#false} ~i~0 := 0; {15281#false} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 46: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 47: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 48: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 49: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 50: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 51: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 52: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 53: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 54: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 55: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 57: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 58: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 59: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 61: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 62: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 63: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 64: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 65: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 66: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 67: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 68: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 69: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 70: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 71: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 72: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 73: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 74: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 75: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 76: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,152 INFO L290 TraceCheckUtils]: 77: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 78: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 79: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 80: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 81: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 82: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 83: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 84: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 85: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 86: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 87: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 88: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 89: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 90: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 91: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 92: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 93: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 94: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,153 INFO L290 TraceCheckUtils]: 95: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,154 INFO L290 TraceCheckUtils]: 96: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,154 INFO L290 TraceCheckUtils]: 97: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,154 INFO L290 TraceCheckUtils]: 98: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,154 INFO L290 TraceCheckUtils]: 99: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,154 INFO L290 TraceCheckUtils]: 100: Hoare triple {15281#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15281#false} is VALID [2022-04-15 12:09:58,154 INFO L290 TraceCheckUtils]: 101: Hoare triple {15281#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15281#false} is VALID [2022-04-15 12:09:58,154 INFO L290 TraceCheckUtils]: 102: Hoare triple {15281#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15281#false} is VALID [2022-04-15 12:09:58,154 INFO L290 TraceCheckUtils]: 103: Hoare triple {15281#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {15281#false} is VALID [2022-04-15 12:09:58,154 INFO L290 TraceCheckUtils]: 104: Hoare triple {15281#false} assume !false; {15281#false} is VALID [2022-04-15 12:09:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2022-04-15 12:09:58,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:09:58,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797816536] [2022-04-15 12:09:58,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797816536] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:09:58,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694326693] [2022-04-15 12:09:58,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:09:58,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:09:58,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:09:58,172 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:09:58,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 12:10:01,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:10:01,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:10:01,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 12:10:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:10:01,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:10:02,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {15280#true} call ULTIMATE.init(); {15280#true} is VALID [2022-04-15 12:10:02,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {15280#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); {15280#true} is VALID [2022-04-15 12:10:02,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {15280#true} assume true; {15280#true} is VALID [2022-04-15 12:10:02,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15280#true} {15280#true} #43#return; {15280#true} is VALID [2022-04-15 12:10:02,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {15280#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {15280#true} is VALID [2022-04-15 12:10:02,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {15280#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; {15280#true} is VALID [2022-04-15 12:10:02,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,328 INFO L290 TraceCheckUtils]: 42: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:02,328 INFO L290 TraceCheckUtils]: 43: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:02,328 INFO L290 TraceCheckUtils]: 44: Hoare triple {15280#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {15280#true} is VALID [2022-04-15 12:10:02,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {15280#true} ~i~0 := 0; {15285#(= main_~i~0 0)} is VALID [2022-04-15 12:10:02,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {15285#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15285#(= main_~i~0 0)} is VALID [2022-04-15 12:10:02,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {15285#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15285#(= main_~i~0 0)} is VALID [2022-04-15 12:10:02,329 INFO L290 TraceCheckUtils]: 48: Hoare triple {15285#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15286#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:10:02,330 INFO L290 TraceCheckUtils]: 49: Hoare triple {15286#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15286#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:10:02,330 INFO L290 TraceCheckUtils]: 50: Hoare triple {15286#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15286#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:10:02,331 INFO L290 TraceCheckUtils]: 51: Hoare triple {15286#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15287#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:10:02,331 INFO L290 TraceCheckUtils]: 52: Hoare triple {15287#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15287#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:10:02,332 INFO L290 TraceCheckUtils]: 53: Hoare triple {15287#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15287#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:10:02,332 INFO L290 TraceCheckUtils]: 54: Hoare triple {15287#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15288#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:10:02,333 INFO L290 TraceCheckUtils]: 55: Hoare triple {15288#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15288#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:10:02,333 INFO L290 TraceCheckUtils]: 56: Hoare triple {15288#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15288#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:10:02,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {15288#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15289#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:10:02,334 INFO L290 TraceCheckUtils]: 58: Hoare triple {15289#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15289#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:10:02,334 INFO L290 TraceCheckUtils]: 59: Hoare triple {15289#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15289#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:10:02,335 INFO L290 TraceCheckUtils]: 60: Hoare triple {15289#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15290#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:10:02,335 INFO L290 TraceCheckUtils]: 61: Hoare triple {15290#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15290#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:10:02,336 INFO L290 TraceCheckUtils]: 62: Hoare triple {15290#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15290#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:10:02,336 INFO L290 TraceCheckUtils]: 63: Hoare triple {15290#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15291#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:10:02,336 INFO L290 TraceCheckUtils]: 64: Hoare triple {15291#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15291#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:10:02,337 INFO L290 TraceCheckUtils]: 65: Hoare triple {15291#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15291#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:10:02,337 INFO L290 TraceCheckUtils]: 66: Hoare triple {15291#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15292#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:10:02,338 INFO L290 TraceCheckUtils]: 67: Hoare triple {15292#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15292#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:10:02,338 INFO L290 TraceCheckUtils]: 68: Hoare triple {15292#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15292#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:10:02,339 INFO L290 TraceCheckUtils]: 69: Hoare triple {15292#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15293#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:10:02,339 INFO L290 TraceCheckUtils]: 70: Hoare triple {15293#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15293#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:10:02,339 INFO L290 TraceCheckUtils]: 71: Hoare triple {15293#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15293#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:10:02,340 INFO L290 TraceCheckUtils]: 72: Hoare triple {15293#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15294#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:10:02,340 INFO L290 TraceCheckUtils]: 73: Hoare triple {15294#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15294#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:10:02,341 INFO L290 TraceCheckUtils]: 74: Hoare triple {15294#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15294#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:10:02,341 INFO L290 TraceCheckUtils]: 75: Hoare triple {15294#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15295#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:10:02,342 INFO L290 TraceCheckUtils]: 76: Hoare triple {15295#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15295#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:10:02,342 INFO L290 TraceCheckUtils]: 77: Hoare triple {15295#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15295#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:10:02,343 INFO L290 TraceCheckUtils]: 78: Hoare triple {15295#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15296#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:10:02,343 INFO L290 TraceCheckUtils]: 79: Hoare triple {15296#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15296#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:10:02,343 INFO L290 TraceCheckUtils]: 80: Hoare triple {15296#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15296#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:10:02,344 INFO L290 TraceCheckUtils]: 81: Hoare triple {15296#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15297#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:10:02,344 INFO L290 TraceCheckUtils]: 82: Hoare triple {15297#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15297#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:10:02,345 INFO L290 TraceCheckUtils]: 83: Hoare triple {15297#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15297#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:10:02,345 INFO L290 TraceCheckUtils]: 84: Hoare triple {15297#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15298#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:10:02,346 INFO L290 TraceCheckUtils]: 85: Hoare triple {15298#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15298#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:10:02,346 INFO L290 TraceCheckUtils]: 86: Hoare triple {15298#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15298#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:10:02,346 INFO L290 TraceCheckUtils]: 87: Hoare triple {15298#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15299#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:10:02,347 INFO L290 TraceCheckUtils]: 88: Hoare triple {15299#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15299#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:10:02,347 INFO L290 TraceCheckUtils]: 89: Hoare triple {15299#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15299#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:10:02,348 INFO L290 TraceCheckUtils]: 90: Hoare triple {15299#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15300#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:10:02,348 INFO L290 TraceCheckUtils]: 91: Hoare triple {15300#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15300#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:10:02,349 INFO L290 TraceCheckUtils]: 92: Hoare triple {15300#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15300#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:10:02,349 INFO L290 TraceCheckUtils]: 93: Hoare triple {15300#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15301#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:10:02,349 INFO L290 TraceCheckUtils]: 94: Hoare triple {15301#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15301#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:10:02,350 INFO L290 TraceCheckUtils]: 95: Hoare triple {15301#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15301#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:10:02,350 INFO L290 TraceCheckUtils]: 96: Hoare triple {15301#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15302#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:10:02,351 INFO L290 TraceCheckUtils]: 97: Hoare triple {15302#(and (<= 17 main_~i~0) (<= main_~i~0 17))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15302#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:10:02,351 INFO L290 TraceCheckUtils]: 98: Hoare triple {15302#(and (<= 17 main_~i~0) (<= main_~i~0 17))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15302#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:10:02,351 INFO L290 TraceCheckUtils]: 99: Hoare triple {15302#(and (<= 17 main_~i~0) (<= main_~i~0 17))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15303#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-15 12:10:02,352 INFO L290 TraceCheckUtils]: 100: Hoare triple {15303#(and (<= main_~i~0 18) (<= 18 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15303#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-15 12:10:02,352 INFO L290 TraceCheckUtils]: 101: Hoare triple {15303#(and (<= main_~i~0 18) (<= 18 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15303#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-15 12:10:02,352 INFO L290 TraceCheckUtils]: 102: Hoare triple {15303#(and (<= main_~i~0 18) (<= 18 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15615#(and (<= 19 main_~i~0) (<= main_~i~0 19))} is VALID [2022-04-15 12:10:02,353 INFO L290 TraceCheckUtils]: 103: Hoare triple {15615#(and (<= 19 main_~i~0) (<= main_~i~0 19))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {15281#false} is VALID [2022-04-15 12:10:02,353 INFO L290 TraceCheckUtils]: 104: Hoare triple {15281#false} assume !false; {15281#false} is VALID [2022-04-15 12:10:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2022-04-15 12:10:02,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:10:03,204 INFO L290 TraceCheckUtils]: 104: Hoare triple {15281#false} assume !false; {15281#false} is VALID [2022-04-15 12:10:03,205 INFO L290 TraceCheckUtils]: 103: Hoare triple {15625#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {15281#false} is VALID [2022-04-15 12:10:03,206 INFO L290 TraceCheckUtils]: 102: Hoare triple {15629#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15625#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:10:03,206 INFO L290 TraceCheckUtils]: 101: Hoare triple {15629#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15629#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,207 INFO L290 TraceCheckUtils]: 100: Hoare triple {15629#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15629#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,207 INFO L290 TraceCheckUtils]: 99: Hoare triple {15639#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15629#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,208 INFO L290 TraceCheckUtils]: 98: Hoare triple {15639#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15639#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,208 INFO L290 TraceCheckUtils]: 97: Hoare triple {15639#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15639#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,209 INFO L290 TraceCheckUtils]: 96: Hoare triple {15649#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15639#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,209 INFO L290 TraceCheckUtils]: 95: Hoare triple {15649#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15649#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,209 INFO L290 TraceCheckUtils]: 94: Hoare triple {15649#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15649#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,210 INFO L290 TraceCheckUtils]: 93: Hoare triple {15659#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15649#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,210 INFO L290 TraceCheckUtils]: 92: Hoare triple {15659#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15659#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,210 INFO L290 TraceCheckUtils]: 91: Hoare triple {15659#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15659#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,211 INFO L290 TraceCheckUtils]: 90: Hoare triple {15669#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15659#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,211 INFO L290 TraceCheckUtils]: 89: Hoare triple {15669#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15669#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,211 INFO L290 TraceCheckUtils]: 88: Hoare triple {15669#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15669#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,212 INFO L290 TraceCheckUtils]: 87: Hoare triple {15679#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15669#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,212 INFO L290 TraceCheckUtils]: 86: Hoare triple {15679#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15679#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,212 INFO L290 TraceCheckUtils]: 85: Hoare triple {15679#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15679#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,213 INFO L290 TraceCheckUtils]: 84: Hoare triple {15689#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15679#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,213 INFO L290 TraceCheckUtils]: 83: Hoare triple {15689#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15689#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,214 INFO L290 TraceCheckUtils]: 82: Hoare triple {15689#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15689#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,214 INFO L290 TraceCheckUtils]: 81: Hoare triple {15699#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15689#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,215 INFO L290 TraceCheckUtils]: 80: Hoare triple {15699#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15699#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,215 INFO L290 TraceCheckUtils]: 79: Hoare triple {15699#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15699#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,215 INFO L290 TraceCheckUtils]: 78: Hoare triple {15709#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15699#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,216 INFO L290 TraceCheckUtils]: 77: Hoare triple {15709#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15709#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,216 INFO L290 TraceCheckUtils]: 76: Hoare triple {15709#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15709#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,217 INFO L290 TraceCheckUtils]: 75: Hoare triple {15719#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15709#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,217 INFO L290 TraceCheckUtils]: 74: Hoare triple {15719#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15719#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,217 INFO L290 TraceCheckUtils]: 73: Hoare triple {15719#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15719#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,218 INFO L290 TraceCheckUtils]: 72: Hoare triple {15729#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15719#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,218 INFO L290 TraceCheckUtils]: 71: Hoare triple {15729#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15729#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,218 INFO L290 TraceCheckUtils]: 70: Hoare triple {15729#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15729#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,219 INFO L290 TraceCheckUtils]: 69: Hoare triple {15739#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15729#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,219 INFO L290 TraceCheckUtils]: 68: Hoare triple {15739#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15739#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,219 INFO L290 TraceCheckUtils]: 67: Hoare triple {15739#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15739#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,220 INFO L290 TraceCheckUtils]: 66: Hoare triple {15749#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15739#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,220 INFO L290 TraceCheckUtils]: 65: Hoare triple {15749#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15749#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,220 INFO L290 TraceCheckUtils]: 64: Hoare triple {15749#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15749#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,221 INFO L290 TraceCheckUtils]: 63: Hoare triple {15759#(< (mod (+ main_~i~0 14) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15749#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,221 INFO L290 TraceCheckUtils]: 62: Hoare triple {15759#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15759#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,221 INFO L290 TraceCheckUtils]: 61: Hoare triple {15759#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15759#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,222 INFO L290 TraceCheckUtils]: 60: Hoare triple {15769#(< (mod (+ main_~i~0 15) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15759#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,222 INFO L290 TraceCheckUtils]: 59: Hoare triple {15769#(< (mod (+ main_~i~0 15) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15769#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,222 INFO L290 TraceCheckUtils]: 58: Hoare triple {15769#(< (mod (+ main_~i~0 15) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15769#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,223 INFO L290 TraceCheckUtils]: 57: Hoare triple {15779#(< (mod (+ main_~i~0 16) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15769#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,223 INFO L290 TraceCheckUtils]: 56: Hoare triple {15779#(< (mod (+ main_~i~0 16) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15779#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,224 INFO L290 TraceCheckUtils]: 55: Hoare triple {15779#(< (mod (+ main_~i~0 16) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15779#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,224 INFO L290 TraceCheckUtils]: 54: Hoare triple {15789#(< (mod (+ main_~i~0 17) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15779#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,225 INFO L290 TraceCheckUtils]: 53: Hoare triple {15789#(< (mod (+ main_~i~0 17) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15789#(< (mod (+ main_~i~0 17) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,225 INFO L290 TraceCheckUtils]: 52: Hoare triple {15789#(< (mod (+ main_~i~0 17) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15789#(< (mod (+ main_~i~0 17) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,225 INFO L290 TraceCheckUtils]: 51: Hoare triple {15799#(< (mod (+ main_~i~0 18) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15789#(< (mod (+ main_~i~0 17) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,226 INFO L290 TraceCheckUtils]: 50: Hoare triple {15799#(< (mod (+ main_~i~0 18) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15799#(< (mod (+ main_~i~0 18) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,226 INFO L290 TraceCheckUtils]: 49: Hoare triple {15799#(< (mod (+ main_~i~0 18) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15799#(< (mod (+ main_~i~0 18) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {15809#(< (mod (+ 19 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15799#(< (mod (+ main_~i~0 18) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {15809#(< (mod (+ 19 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {15809#(< (mod (+ 19 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {15809#(< (mod (+ 19 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {15809#(< (mod (+ 19 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,228 INFO L290 TraceCheckUtils]: 45: Hoare triple {15280#true} ~i~0 := 0; {15809#(< (mod (+ 19 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:03,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {15280#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {15280#true} is VALID [2022-04-15 12:10:03,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,228 INFO L290 TraceCheckUtils]: 40: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,228 INFO L290 TraceCheckUtils]: 39: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,228 INFO L290 TraceCheckUtils]: 38: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 31: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {15280#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15280#true} is VALID [2022-04-15 12:10:03,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {15280#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {15280#true} is VALID [2022-04-15 12:10:03,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {15280#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; {15280#true} is VALID [2022-04-15 12:10:03,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {15280#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {15280#true} is VALID [2022-04-15 12:10:03,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15280#true} {15280#true} #43#return; {15280#true} is VALID [2022-04-15 12:10:03,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {15280#true} assume true; {15280#true} is VALID [2022-04-15 12:10:03,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {15280#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); {15280#true} is VALID [2022-04-15 12:10:03,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {15280#true} call ULTIMATE.init(); {15280#true} is VALID [2022-04-15 12:10:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2022-04-15 12:10:03,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694326693] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:10:03,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:10:03,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-15 12:10:03,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:10:03,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1708254995] [2022-04-15 12:10:03,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1708254995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:10:03,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:10:03,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:10:03,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391137831] [2022-04-15 12:10:03,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:10:03,232 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 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 105 [2022-04-15 12:10:03,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:10:03,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:03,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:10:03,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:10:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:10:03,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:10:03,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=525, Invalid=1367, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 12:10:03,272 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:10:05,320 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2022-04-15 12:10:05,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:10:05,320 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 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 105 [2022-04-15 12:10:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:10:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 123 transitions. [2022-04-15 12:10:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 123 transitions. [2022-04-15 12:10:05,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 123 transitions. [2022-04-15 12:10:05,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:10:05,612 INFO L225 Difference]: With dead ends: 175 [2022-04-15 12:10:05,613 INFO L226 Difference]: Without dead ends: 114 [2022-04-15 12:10:05,613 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=550, Invalid=1430, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:10:05,613 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 64 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:10:05,614 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 463 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:10:05,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-15 12:10:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2022-04-15 12:10:05,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:10:05,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 111 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:05,707 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 111 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:05,707 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 111 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:10:05,709 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2022-04-15 12:10:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2022-04-15 12:10:05,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:10:05,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:10:05,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 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 114 states. [2022-04-15 12:10:05,709 INFO L87 Difference]: Start difference. First operand has 111 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 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 114 states. [2022-04-15 12:10:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:10:05,710 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2022-04-15 12:10:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2022-04-15 12:10:05,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:10:05,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:10:05,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:10:05,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:10:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2022-04-15 12:10:05,711 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 105 [2022-04-15 12:10:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:10:05,712 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2022-04-15 12:10:05,712 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:05,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 112 transitions. [2022-04-15 12:10:05,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:10:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2022-04-15 12:10:05,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 12:10:05,794 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:10:05,794 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:10:05,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 12:10:06,014 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:10:06,014 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:10:06,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:10:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1921487304, now seen corresponding path program 39 times [2022-04-15 12:10:06,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:10:06,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1441449847] [2022-04-15 12:10:06,018 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:10:06,018 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:10:06,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1921487304, now seen corresponding path program 40 times [2022-04-15 12:10:06,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:10:06,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568815600] [2022-04-15 12:10:06,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:10:06,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:10:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:10:06,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:10:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:10:06,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {16784#(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); {16758#true} is VALID [2022-04-15 12:10:06,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {16758#true} assume true; {16758#true} is VALID [2022-04-15 12:10:06,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16758#true} {16758#true} #43#return; {16758#true} is VALID [2022-04-15 12:10:06,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {16758#true} call ULTIMATE.init(); {16784#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:10:06,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {16784#(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); {16758#true} is VALID [2022-04-15 12:10:06,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {16758#true} assume true; {16758#true} is VALID [2022-04-15 12:10:06,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16758#true} {16758#true} #43#return; {16758#true} is VALID [2022-04-15 12:10:06,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {16758#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {16758#true} is VALID [2022-04-15 12:10:06,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {16758#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; {16763#(= main_~i~0 0)} is VALID [2022-04-15 12:10:06,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {16763#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16763#(= main_~i~0 0)} is VALID [2022-04-15 12:10:06,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {16763#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16764#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:10:06,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {16764#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16764#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:10:06,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {16764#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16765#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:10:06,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {16765#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16765#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:10:06,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {16765#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16766#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:10:06,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {16766#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16766#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:10:06,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {16766#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16767#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:10:06,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {16767#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16767#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:10:06,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {16767#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16768#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:10:06,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {16768#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16768#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:10:06,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {16768#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16769#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:10:06,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {16769#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16769#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:10:06,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {16769#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16770#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:10:06,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {16770#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16770#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:10:06,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {16770#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16771#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:10:06,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {16771#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16771#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:10:06,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {16771#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16772#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:10:06,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {16772#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16772#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:10:06,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {16772#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16773#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:10:06,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {16773#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16773#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:10:06,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {16773#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16774#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:10:06,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {16774#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16774#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:10:06,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {16774#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16775#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:10:06,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {16775#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16775#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:10:06,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {16775#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16776#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:10:06,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {16776#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16776#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:10:06,417 INFO L290 TraceCheckUtils]: 33: Hoare triple {16776#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16777#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:10:06,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {16777#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16777#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:10:06,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {16777#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16778#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:10:06,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {16778#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16778#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:10:06,419 INFO L290 TraceCheckUtils]: 37: Hoare triple {16778#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16779#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:10:06,419 INFO L290 TraceCheckUtils]: 38: Hoare triple {16779#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16779#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:10:06,420 INFO L290 TraceCheckUtils]: 39: Hoare triple {16779#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16780#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:10:06,420 INFO L290 TraceCheckUtils]: 40: Hoare triple {16780#(and (<= 17 main_~i~0) (<= main_~i~0 17))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16780#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:10:06,420 INFO L290 TraceCheckUtils]: 41: Hoare triple {16780#(and (<= 17 main_~i~0) (<= main_~i~0 17))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16781#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-15 12:10:06,421 INFO L290 TraceCheckUtils]: 42: Hoare triple {16781#(and (<= main_~i~0 18) (<= 18 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16781#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-15 12:10:06,421 INFO L290 TraceCheckUtils]: 43: Hoare triple {16781#(and (<= main_~i~0 18) (<= 18 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16782#(and (<= 19 main_~i~0) (<= main_~i~0 19))} is VALID [2022-04-15 12:10:06,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {16782#(and (<= 19 main_~i~0) (<= main_~i~0 19))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16782#(and (<= 19 main_~i~0) (<= main_~i~0 19))} is VALID [2022-04-15 12:10:06,422 INFO L290 TraceCheckUtils]: 45: Hoare triple {16782#(and (<= 19 main_~i~0) (<= main_~i~0 19))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16783#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 20))} is VALID [2022-04-15 12:10:06,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {16783#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 20))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {16759#false} is VALID [2022-04-15 12:10:06,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {16759#false} ~i~0 := 0; {16759#false} is VALID [2022-04-15 12:10:06,422 INFO L290 TraceCheckUtils]: 48: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,422 INFO L290 TraceCheckUtils]: 49: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,422 INFO L290 TraceCheckUtils]: 50: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,422 INFO L290 TraceCheckUtils]: 51: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,422 INFO L290 TraceCheckUtils]: 52: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 54: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 55: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 58: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 59: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 60: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 62: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 63: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 64: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 65: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 66: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 67: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 68: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 69: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 70: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,423 INFO L290 TraceCheckUtils]: 71: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 72: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 73: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 74: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 75: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 76: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 77: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 78: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 79: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 80: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 81: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 82: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 83: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 84: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 85: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 86: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 87: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 88: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 89: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 90: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,424 INFO L290 TraceCheckUtils]: 91: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 92: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 93: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 94: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 95: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 96: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 97: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 98: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 99: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 100: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 101: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 102: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 103: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 104: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 105: Hoare triple {16759#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 106: Hoare triple {16759#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 107: Hoare triple {16759#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 108: Hoare triple {16759#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {16759#false} is VALID [2022-04-15 12:10:06,425 INFO L290 TraceCheckUtils]: 109: Hoare triple {16759#false} assume !false; {16759#false} is VALID [2022-04-15 12:10:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2022-04-15 12:10:06,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:10:06,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568815600] [2022-04-15 12:10:06,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568815600] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:10:06,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743907409] [2022-04-15 12:10:06,426 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:10:06,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:10:06,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:10:06,427 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:10:06,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 12:10:12,932 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:10:12,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:10:12,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 12:10:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:10:12,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:10:13,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {16758#true} call ULTIMATE.init(); {16758#true} is VALID [2022-04-15 12:10:13,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {16758#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); {16758#true} is VALID [2022-04-15 12:10:13,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {16758#true} assume true; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16758#true} {16758#true} #43#return; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {16758#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {16758#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; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,550 INFO L290 TraceCheckUtils]: 40: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,551 INFO L290 TraceCheckUtils]: 42: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,551 INFO L290 TraceCheckUtils]: 43: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:13,551 INFO L290 TraceCheckUtils]: 45: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:13,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {16758#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {16758#true} is VALID [2022-04-15 12:10:13,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {16758#true} ~i~0 := 0; {16763#(= main_~i~0 0)} is VALID [2022-04-15 12:10:13,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {16763#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16763#(= main_~i~0 0)} is VALID [2022-04-15 12:10:13,552 INFO L290 TraceCheckUtils]: 49: Hoare triple {16763#(= main_~i~0 0)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16763#(= main_~i~0 0)} is VALID [2022-04-15 12:10:13,552 INFO L290 TraceCheckUtils]: 50: Hoare triple {16763#(= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16764#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:10:13,552 INFO L290 TraceCheckUtils]: 51: Hoare triple {16764#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16764#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:10:13,553 INFO L290 TraceCheckUtils]: 52: Hoare triple {16764#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16764#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:10:13,553 INFO L290 TraceCheckUtils]: 53: Hoare triple {16764#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16765#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:10:13,553 INFO L290 TraceCheckUtils]: 54: Hoare triple {16765#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16765#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:10:13,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {16765#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16765#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:10:13,554 INFO L290 TraceCheckUtils]: 56: Hoare triple {16765#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16766#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:10:13,555 INFO L290 TraceCheckUtils]: 57: Hoare triple {16766#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16766#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:10:13,555 INFO L290 TraceCheckUtils]: 58: Hoare triple {16766#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16766#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:10:13,555 INFO L290 TraceCheckUtils]: 59: Hoare triple {16766#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16767#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:10:13,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {16767#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16767#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:10:13,556 INFO L290 TraceCheckUtils]: 61: Hoare triple {16767#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16767#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:10:13,556 INFO L290 TraceCheckUtils]: 62: Hoare triple {16767#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16768#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:10:13,557 INFO L290 TraceCheckUtils]: 63: Hoare triple {16768#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16768#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:10:13,557 INFO L290 TraceCheckUtils]: 64: Hoare triple {16768#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16768#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:10:13,558 INFO L290 TraceCheckUtils]: 65: Hoare triple {16768#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16769#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:10:13,558 INFO L290 TraceCheckUtils]: 66: Hoare triple {16769#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16769#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:10:13,558 INFO L290 TraceCheckUtils]: 67: Hoare triple {16769#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16769#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:10:13,559 INFO L290 TraceCheckUtils]: 68: Hoare triple {16769#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16770#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:10:13,559 INFO L290 TraceCheckUtils]: 69: Hoare triple {16770#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16770#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:10:13,559 INFO L290 TraceCheckUtils]: 70: Hoare triple {16770#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16770#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:10:13,560 INFO L290 TraceCheckUtils]: 71: Hoare triple {16770#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16771#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:10:13,560 INFO L290 TraceCheckUtils]: 72: Hoare triple {16771#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16771#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:10:13,560 INFO L290 TraceCheckUtils]: 73: Hoare triple {16771#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16771#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:10:13,561 INFO L290 TraceCheckUtils]: 74: Hoare triple {16771#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16772#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:10:13,561 INFO L290 TraceCheckUtils]: 75: Hoare triple {16772#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16772#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:10:13,561 INFO L290 TraceCheckUtils]: 76: Hoare triple {16772#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16772#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:10:13,562 INFO L290 TraceCheckUtils]: 77: Hoare triple {16772#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16773#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:10:13,562 INFO L290 TraceCheckUtils]: 78: Hoare triple {16773#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16773#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:10:13,562 INFO L290 TraceCheckUtils]: 79: Hoare triple {16773#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16773#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:10:13,563 INFO L290 TraceCheckUtils]: 80: Hoare triple {16773#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16774#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:10:13,563 INFO L290 TraceCheckUtils]: 81: Hoare triple {16774#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16774#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:10:13,563 INFO L290 TraceCheckUtils]: 82: Hoare triple {16774#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16774#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:10:13,564 INFO L290 TraceCheckUtils]: 83: Hoare triple {16774#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16775#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:10:13,564 INFO L290 TraceCheckUtils]: 84: Hoare triple {16775#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16775#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:10:13,564 INFO L290 TraceCheckUtils]: 85: Hoare triple {16775#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16775#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:10:13,565 INFO L290 TraceCheckUtils]: 86: Hoare triple {16775#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16776#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:10:13,565 INFO L290 TraceCheckUtils]: 87: Hoare triple {16776#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16776#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:10:13,565 INFO L290 TraceCheckUtils]: 88: Hoare triple {16776#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16776#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:10:13,566 INFO L290 TraceCheckUtils]: 89: Hoare triple {16776#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16777#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:10:13,566 INFO L290 TraceCheckUtils]: 90: Hoare triple {16777#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16777#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:10:13,566 INFO L290 TraceCheckUtils]: 91: Hoare triple {16777#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16777#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:10:13,567 INFO L290 TraceCheckUtils]: 92: Hoare triple {16777#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16778#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:10:13,567 INFO L290 TraceCheckUtils]: 93: Hoare triple {16778#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16778#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:10:13,567 INFO L290 TraceCheckUtils]: 94: Hoare triple {16778#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16778#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:10:13,568 INFO L290 TraceCheckUtils]: 95: Hoare triple {16778#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16779#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:10:13,568 INFO L290 TraceCheckUtils]: 96: Hoare triple {16779#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16779#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:10:13,568 INFO L290 TraceCheckUtils]: 97: Hoare triple {16779#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16779#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:10:13,569 INFO L290 TraceCheckUtils]: 98: Hoare triple {16779#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16780#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:10:13,569 INFO L290 TraceCheckUtils]: 99: Hoare triple {16780#(and (<= 17 main_~i~0) (<= main_~i~0 17))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16780#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:10:13,569 INFO L290 TraceCheckUtils]: 100: Hoare triple {16780#(and (<= 17 main_~i~0) (<= main_~i~0 17))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16780#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:10:13,570 INFO L290 TraceCheckUtils]: 101: Hoare triple {16780#(and (<= 17 main_~i~0) (<= main_~i~0 17))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16781#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-15 12:10:13,570 INFO L290 TraceCheckUtils]: 102: Hoare triple {16781#(and (<= main_~i~0 18) (<= 18 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16781#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-15 12:10:13,570 INFO L290 TraceCheckUtils]: 103: Hoare triple {16781#(and (<= main_~i~0 18) (<= 18 main_~i~0))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16781#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-15 12:10:13,571 INFO L290 TraceCheckUtils]: 104: Hoare triple {16781#(and (<= main_~i~0 18) (<= 18 main_~i~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16782#(and (<= 19 main_~i~0) (<= main_~i~0 19))} is VALID [2022-04-15 12:10:13,571 INFO L290 TraceCheckUtils]: 105: Hoare triple {16782#(and (<= 19 main_~i~0) (<= main_~i~0 19))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {16782#(and (<= 19 main_~i~0) (<= main_~i~0 19))} is VALID [2022-04-15 12:10:13,571 INFO L290 TraceCheckUtils]: 106: Hoare triple {16782#(and (<= 19 main_~i~0) (<= main_~i~0 19))} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {16782#(and (<= 19 main_~i~0) (<= main_~i~0 19))} is VALID [2022-04-15 12:10:13,572 INFO L290 TraceCheckUtils]: 107: Hoare triple {16782#(and (<= 19 main_~i~0) (<= main_~i~0 19))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17109#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 12:10:13,572 INFO L290 TraceCheckUtils]: 108: Hoare triple {17109#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {16759#false} is VALID [2022-04-15 12:10:13,572 INFO L290 TraceCheckUtils]: 109: Hoare triple {16759#false} assume !false; {16759#false} is VALID [2022-04-15 12:10:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-15 12:10:13,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:10:14,452 INFO L290 TraceCheckUtils]: 109: Hoare triple {16759#false} assume !false; {16759#false} is VALID [2022-04-15 12:10:14,452 INFO L290 TraceCheckUtils]: 108: Hoare triple {17119#(< (mod main_~i~0 4294967296) 102400)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {16759#false} is VALID [2022-04-15 12:10:14,453 INFO L290 TraceCheckUtils]: 107: Hoare triple {17123#(< (mod (+ main_~i~0 1) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17119#(< (mod main_~i~0 4294967296) 102400)} is VALID [2022-04-15 12:10:14,453 INFO L290 TraceCheckUtils]: 106: Hoare triple {17123#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17123#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,453 INFO L290 TraceCheckUtils]: 105: Hoare triple {17123#(< (mod (+ main_~i~0 1) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17123#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,454 INFO L290 TraceCheckUtils]: 104: Hoare triple {17133#(< (mod (+ main_~i~0 2) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17123#(< (mod (+ main_~i~0 1) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,454 INFO L290 TraceCheckUtils]: 103: Hoare triple {17133#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17133#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,454 INFO L290 TraceCheckUtils]: 102: Hoare triple {17133#(< (mod (+ main_~i~0 2) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17133#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,455 INFO L290 TraceCheckUtils]: 101: Hoare triple {17143#(< (mod (+ main_~i~0 3) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17133#(< (mod (+ main_~i~0 2) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,455 INFO L290 TraceCheckUtils]: 100: Hoare triple {17143#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17143#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,455 INFO L290 TraceCheckUtils]: 99: Hoare triple {17143#(< (mod (+ main_~i~0 3) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17143#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,456 INFO L290 TraceCheckUtils]: 98: Hoare triple {17153#(< (mod (+ main_~i~0 4) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17143#(< (mod (+ main_~i~0 3) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,456 INFO L290 TraceCheckUtils]: 97: Hoare triple {17153#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17153#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,456 INFO L290 TraceCheckUtils]: 96: Hoare triple {17153#(< (mod (+ main_~i~0 4) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17153#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,457 INFO L290 TraceCheckUtils]: 95: Hoare triple {17163#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17153#(< (mod (+ main_~i~0 4) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,457 INFO L290 TraceCheckUtils]: 94: Hoare triple {17163#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17163#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,457 INFO L290 TraceCheckUtils]: 93: Hoare triple {17163#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17163#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,458 INFO L290 TraceCheckUtils]: 92: Hoare triple {17173#(< (mod (+ main_~i~0 6) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17163#(< (mod (+ 5 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,458 INFO L290 TraceCheckUtils]: 91: Hoare triple {17173#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17173#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,458 INFO L290 TraceCheckUtils]: 90: Hoare triple {17173#(< (mod (+ main_~i~0 6) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17173#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,459 INFO L290 TraceCheckUtils]: 89: Hoare triple {17183#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17173#(< (mod (+ main_~i~0 6) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,459 INFO L290 TraceCheckUtils]: 88: Hoare triple {17183#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17183#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,459 INFO L290 TraceCheckUtils]: 87: Hoare triple {17183#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17183#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,460 INFO L290 TraceCheckUtils]: 86: Hoare triple {17193#(< (mod (+ main_~i~0 8) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17183#(< (mod (+ 7 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,460 INFO L290 TraceCheckUtils]: 85: Hoare triple {17193#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17193#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,460 INFO L290 TraceCheckUtils]: 84: Hoare triple {17193#(< (mod (+ main_~i~0 8) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17193#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,461 INFO L290 TraceCheckUtils]: 83: Hoare triple {17203#(< (mod (+ main_~i~0 9) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17193#(< (mod (+ main_~i~0 8) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,461 INFO L290 TraceCheckUtils]: 82: Hoare triple {17203#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17203#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,461 INFO L290 TraceCheckUtils]: 81: Hoare triple {17203#(< (mod (+ main_~i~0 9) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17203#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,462 INFO L290 TraceCheckUtils]: 80: Hoare triple {17213#(< (mod (+ main_~i~0 10) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17203#(< (mod (+ main_~i~0 9) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,462 INFO L290 TraceCheckUtils]: 79: Hoare triple {17213#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17213#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,462 INFO L290 TraceCheckUtils]: 78: Hoare triple {17213#(< (mod (+ main_~i~0 10) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17213#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,463 INFO L290 TraceCheckUtils]: 77: Hoare triple {17223#(< (mod (+ main_~i~0 11) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17213#(< (mod (+ main_~i~0 10) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,463 INFO L290 TraceCheckUtils]: 76: Hoare triple {17223#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17223#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,463 INFO L290 TraceCheckUtils]: 75: Hoare triple {17223#(< (mod (+ main_~i~0 11) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17223#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,464 INFO L290 TraceCheckUtils]: 74: Hoare triple {17233#(< (mod (+ main_~i~0 12) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17223#(< (mod (+ main_~i~0 11) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,464 INFO L290 TraceCheckUtils]: 73: Hoare triple {17233#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17233#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,464 INFO L290 TraceCheckUtils]: 72: Hoare triple {17233#(< (mod (+ main_~i~0 12) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17233#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,465 INFO L290 TraceCheckUtils]: 71: Hoare triple {17243#(< (mod (+ main_~i~0 13) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17233#(< (mod (+ main_~i~0 12) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,465 INFO L290 TraceCheckUtils]: 70: Hoare triple {17243#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17243#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,465 INFO L290 TraceCheckUtils]: 69: Hoare triple {17243#(< (mod (+ main_~i~0 13) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17243#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,466 INFO L290 TraceCheckUtils]: 68: Hoare triple {17253#(< (mod (+ main_~i~0 14) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17243#(< (mod (+ main_~i~0 13) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,466 INFO L290 TraceCheckUtils]: 67: Hoare triple {17253#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17253#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,466 INFO L290 TraceCheckUtils]: 66: Hoare triple {17253#(< (mod (+ main_~i~0 14) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17253#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,467 INFO L290 TraceCheckUtils]: 65: Hoare triple {17263#(< (mod (+ main_~i~0 15) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17253#(< (mod (+ main_~i~0 14) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,467 INFO L290 TraceCheckUtils]: 64: Hoare triple {17263#(< (mod (+ main_~i~0 15) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17263#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,467 INFO L290 TraceCheckUtils]: 63: Hoare triple {17263#(< (mod (+ main_~i~0 15) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17263#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,468 INFO L290 TraceCheckUtils]: 62: Hoare triple {17273#(< (mod (+ main_~i~0 16) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17263#(< (mod (+ main_~i~0 15) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,468 INFO L290 TraceCheckUtils]: 61: Hoare triple {17273#(< (mod (+ main_~i~0 16) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17273#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,468 INFO L290 TraceCheckUtils]: 60: Hoare triple {17273#(< (mod (+ main_~i~0 16) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17273#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,468 INFO L290 TraceCheckUtils]: 59: Hoare triple {17283#(< (mod (+ main_~i~0 17) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17273#(< (mod (+ main_~i~0 16) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,469 INFO L290 TraceCheckUtils]: 58: Hoare triple {17283#(< (mod (+ main_~i~0 17) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17283#(< (mod (+ main_~i~0 17) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,469 INFO L290 TraceCheckUtils]: 57: Hoare triple {17283#(< (mod (+ main_~i~0 17) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17283#(< (mod (+ main_~i~0 17) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,469 INFO L290 TraceCheckUtils]: 56: Hoare triple {17293#(< (mod (+ main_~i~0 18) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17283#(< (mod (+ main_~i~0 17) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,470 INFO L290 TraceCheckUtils]: 55: Hoare triple {17293#(< (mod (+ main_~i~0 18) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17293#(< (mod (+ main_~i~0 18) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {17293#(< (mod (+ main_~i~0 18) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17293#(< (mod (+ main_~i~0 18) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,470 INFO L290 TraceCheckUtils]: 53: Hoare triple {17303#(< (mod (+ 19 main_~i~0) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17293#(< (mod (+ main_~i~0 18) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,471 INFO L290 TraceCheckUtils]: 52: Hoare triple {17303#(< (mod (+ 19 main_~i~0) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17303#(< (mod (+ 19 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,471 INFO L290 TraceCheckUtils]: 51: Hoare triple {17303#(< (mod (+ 19 main_~i~0) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17303#(< (mod (+ 19 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,472 INFO L290 TraceCheckUtils]: 50: Hoare triple {17313#(< (mod (+ main_~i~0 20) 4294967296) 102400)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {17303#(< (mod (+ 19 main_~i~0) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {17313#(< (mod (+ main_~i~0 20) 4294967296) 102400)} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {17313#(< (mod (+ main_~i~0 20) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {17313#(< (mod (+ main_~i~0 20) 4294967296) 102400)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {17313#(< (mod (+ main_~i~0 20) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,472 INFO L290 TraceCheckUtils]: 47: Hoare triple {16758#true} ~i~0 := 0; {17313#(< (mod (+ main_~i~0 20) 4294967296) 102400)} is VALID [2022-04-15 12:10:14,472 INFO L290 TraceCheckUtils]: 46: Hoare triple {16758#true} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {16758#true} is VALID [2022-04-15 12:10:14,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 43: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 42: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 41: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 37: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 36: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 35: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {16758#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {16758#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {16758#true} is VALID [2022-04-15 12:10:14,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {16758#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; {16758#true} is VALID [2022-04-15 12:10:14,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {16758#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {16758#true} is VALID [2022-04-15 12:10:14,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16758#true} {16758#true} #43#return; {16758#true} is VALID [2022-04-15 12:10:14,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {16758#true} assume true; {16758#true} is VALID [2022-04-15 12:10:14,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {16758#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); {16758#true} is VALID [2022-04-15 12:10:14,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {16758#true} call ULTIMATE.init(); {16758#true} is VALID [2022-04-15 12:10:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-15 12:10:14,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743907409] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:10:14,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:10:14,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-15 12:10:14,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:10:14,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1441449847] [2022-04-15 12:10:14,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1441449847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:10:14,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:10:14,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:10:14,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869757939] [2022-04-15 12:10:14,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:10:14,476 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 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 110 [2022-04-15 12:10:14,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:10:14,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:14,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:10:14,511 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:10:14,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:10:14,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:10:14,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1498, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 12:10:14,512 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:10:16,754 INFO L93 Difference]: Finished difference Result 183 states and 186 transitions. [2022-04-15 12:10:16,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:10:16,754 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 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 110 [2022-04-15 12:10:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:10:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 128 transitions. [2022-04-15 12:10:16,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:16,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 128 transitions. [2022-04-15 12:10:16,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 128 transitions. [2022-04-15 12:10:16,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:10:16,859 INFO L225 Difference]: With dead ends: 183 [2022-04-15 12:10:16,859 INFO L226 Difference]: Without dead ends: 119 [2022-04-15 12:10:16,859 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=598, Invalid=1564, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 12:10:16,860 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 71 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:10:16,860 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 497 Invalid, 1849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 12:10:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-15 12:10:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2022-04-15 12:10:17,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:10:17,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 116 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:17,003 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 116 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:17,003 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 116 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:10:17,004 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2022-04-15 12:10:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-04-15 12:10:17,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:10:17,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:10:17,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 states have internal predecessors, (114), 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 119 states. [2022-04-15 12:10:17,005 INFO L87 Difference]: Start difference. First operand has 116 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 states have internal predecessors, (114), 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 119 states. [2022-04-15 12:10:17,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:10:17,006 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2022-04-15 12:10:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-04-15 12:10:17,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:10:17,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:10:17,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:10:17,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:10:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2022-04-15 12:10:17,007 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 110 [2022-04-15 12:10:17,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:10:17,008 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2022-04-15 12:10:17,008 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:10:17,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 117 transitions. [2022-04-15 12:10:17,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:10:17,086 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2022-04-15 12:10:17,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 12:10:17,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:10:17,086 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:10:17,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-15 12:10:17,287 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 12:10:17,287 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:10:17,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:10:17,287 INFO L85 PathProgramCache]: Analyzing trace with hash -507038147, now seen corresponding path program 41 times [2022-04-15 12:10:17,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:10:17,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [361271213] [2022-04-15 12:10:17,292 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:10:17,292 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:10:17,292 INFO L85 PathProgramCache]: Analyzing trace with hash -507038147, now seen corresponding path program 42 times [2022-04-15 12:10:17,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:10:17,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313181319] [2022-04-15 12:10:17,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:10:17,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:10:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:10:17,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:10:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:10:17,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {18331#(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); {18304#true} is VALID [2022-04-15 12:10:17,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {18304#true} assume true; {18304#true} is VALID [2022-04-15 12:10:17,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18304#true} {18304#true} #43#return; {18304#true} is VALID [2022-04-15 12:10:17,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {18304#true} call ULTIMATE.init(); {18331#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:10:17,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {18331#(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); {18304#true} is VALID [2022-04-15 12:10:17,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {18304#true} assume true; {18304#true} is VALID [2022-04-15 12:10:17,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18304#true} {18304#true} #43#return; {18304#true} is VALID [2022-04-15 12:10:17,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {18304#true} call #t~ret9 := main(#in~argc, #in~argv.base, #in~argv.offset); {18304#true} is VALID [2022-04-15 12:10:17,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {18304#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; {18309#(= main_~i~0 0)} is VALID [2022-04-15 12:10:17,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {18309#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18309#(= main_~i~0 0)} is VALID [2022-04-15 12:10:17,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {18309#(= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18310#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:10:17,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {18310#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18310#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:10:17,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {18310#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18311#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:10:17,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {18311#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18311#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:10:17,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {18311#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18312#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:10:17,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {18312#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18312#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:10:17,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {18312#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18313#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:10:17,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {18313#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18313#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:10:17,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {18313#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18314#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:10:17,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {18314#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18314#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:10:17,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {18314#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18315#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:10:17,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {18315#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18315#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:10:17,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {18315#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18316#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:10:17,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {18316#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18316#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:10:17,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {18316#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18317#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:10:17,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {18317#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18317#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:10:17,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {18317#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18318#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:10:17,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {18318#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18318#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:10:17,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {18318#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18319#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:10:17,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {18319#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18319#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:10:17,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {18319#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18320#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:10:17,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {18320#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18320#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:10:17,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {18320#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18321#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:10:17,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {18321#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18321#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:10:17,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {18321#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18322#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:10:17,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {18322#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18322#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:10:17,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {18322#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18323#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:10:17,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {18323#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18323#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:10:17,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {18323#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18324#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:10:17,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {18324#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18324#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:10:17,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {18324#(and (<= 15 main_~i~0) (<= main_~i~0 15))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18325#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:10:17,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {18325#(and (<= main_~i~0 16) (<= 16 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18325#(and (<= main_~i~0 16) (<= 16 main_~i~0))} is VALID [2022-04-15 12:10:17,680 INFO L290 TraceCheckUtils]: 39: Hoare triple {18325#(and (<= main_~i~0 16) (<= 16 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18326#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:10:17,680 INFO L290 TraceCheckUtils]: 40: Hoare triple {18326#(and (<= 17 main_~i~0) (<= main_~i~0 17))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18326#(and (<= 17 main_~i~0) (<= main_~i~0 17))} is VALID [2022-04-15 12:10:17,681 INFO L290 TraceCheckUtils]: 41: Hoare triple {18326#(and (<= 17 main_~i~0) (<= main_~i~0 17))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18327#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-15 12:10:17,681 INFO L290 TraceCheckUtils]: 42: Hoare triple {18327#(and (<= main_~i~0 18) (<= 18 main_~i~0))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18327#(and (<= main_~i~0 18) (<= 18 main_~i~0))} is VALID [2022-04-15 12:10:17,682 INFO L290 TraceCheckUtils]: 43: Hoare triple {18327#(and (<= main_~i~0 18) (<= 18 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18328#(and (<= 19 main_~i~0) (<= main_~i~0 19))} is VALID [2022-04-15 12:10:17,682 INFO L290 TraceCheckUtils]: 44: Hoare triple {18328#(and (<= 19 main_~i~0) (<= main_~i~0 19))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18328#(and (<= 19 main_~i~0) (<= main_~i~0 19))} is VALID [2022-04-15 12:10:17,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {18328#(and (<= 19 main_~i~0) (<= main_~i~0 19))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18329#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 12:10:17,683 INFO L290 TraceCheckUtils]: 46: Hoare triple {18329#(and (<= 20 main_~i~0) (<= main_~i~0 20))} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);assume -128 <= #t~nondet6 && #t~nondet6 <= 127;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~nondet6; {18329#(and (<= 20 main_~i~0) (<= main_~i~0 20))} is VALID [2022-04-15 12:10:17,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {18329#(and (<= 20 main_~i~0) (<= main_~i~0 20))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18330#(and (<= main_~i~0 21) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:10:17,684 INFO L290 TraceCheckUtils]: 48: Hoare triple {18330#(and (<= main_~i~0 21) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {18305#false} is VALID [2022-04-15 12:10:17,684 INFO L290 TraceCheckUtils]: 49: Hoare triple {18305#false} ~i~0 := 0; {18305#false} is VALID [2022-04-15 12:10:17,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,684 INFO L290 TraceCheckUtils]: 52: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,684 INFO L290 TraceCheckUtils]: 53: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,684 INFO L290 TraceCheckUtils]: 54: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,684 INFO L290 TraceCheckUtils]: 55: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,684 INFO L290 TraceCheckUtils]: 56: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,684 INFO L290 TraceCheckUtils]: 57: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,684 INFO L290 TraceCheckUtils]: 58: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 59: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 60: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 61: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 62: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 63: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 64: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 65: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 66: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 67: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 68: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 69: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 70: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 71: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 72: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 73: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 74: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 75: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 76: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 77: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,685 INFO L290 TraceCheckUtils]: 78: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 79: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 80: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 81: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 82: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 83: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 84: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 85: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 86: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 87: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 88: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 89: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 90: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 91: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 92: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 93: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 94: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 95: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 96: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 97: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,686 INFO L290 TraceCheckUtils]: 98: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,687 INFO L290 TraceCheckUtils]: 99: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,687 INFO L290 TraceCheckUtils]: 100: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,687 INFO L290 TraceCheckUtils]: 101: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,687 INFO L290 TraceCheckUtils]: 102: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,687 INFO L290 TraceCheckUtils]: 103: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,687 INFO L290 TraceCheckUtils]: 104: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,687 INFO L290 TraceCheckUtils]: 105: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,687 INFO L290 TraceCheckUtils]: 106: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,687 INFO L290 TraceCheckUtils]: 107: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,687 INFO L290 TraceCheckUtils]: 108: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,687 INFO L290 TraceCheckUtils]: 109: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,687 INFO L290 TraceCheckUtils]: 110: Hoare triple {18305#false} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 102400);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1); {18305#false} is VALID [2022-04-15 12:10:17,687 INFO L290 TraceCheckUtils]: 111: Hoare triple {18305#false} assume !(#t~mem8 == ~ND~0);havoc #t~mem8; {18305#false} is VALID [2022-04-15 12:10:17,687 INFO L290 TraceCheckUtils]: 112: Hoare triple {18305#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18305#false} is VALID [2022-04-15 12:10:17,687 INFO L290 TraceCheckUtils]: 113: Hoare triple {18305#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 102400); {18305#false} is VALID [2022-04-15 12:10:17,687 INFO L290 TraceCheckUtils]: 114: Hoare triple {18305#false} assume !false; {18305#false} is VALID [2022-04-15 12:10:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2022-04-15 12:10:17,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:10:17,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313181319] [2022-04-15 12:10:17,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313181319] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:10:17,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948461239] [2022-04-15 12:10:17,688 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:10:17,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:10:17,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:10:17,689 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:10:17,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process