/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:23:38,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:23:38,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:23:39,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:23:39,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:23:39,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:23:39,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:23:39,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:23:39,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:23:39,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:23:39,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:23:39,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:23:39,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:23:39,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:23:39,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:23:39,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:23:39,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:23:39,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:23:39,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:23:39,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:23:39,036 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:23:39,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:23:39,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:23:39,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:23:39,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:23:39,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:23:39,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:23:39,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:23:39,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:23:39,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:23:39,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:23:39,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:23:39,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:23:39,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:23:39,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:23:39,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:23:39,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:23:39,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:23:39,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:23:39,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:23:39,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:23:39,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:23:39,054 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:23:39,082 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:23:39,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:23:39,083 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:23:39,083 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:23:39,084 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:23:39,084 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:23:39,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:23:39,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:23:39,085 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:23:39,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:23:39,086 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:23:39,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:23:39,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:23:39,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:23:39,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:23:39,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:23:39,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:23:39,088 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:23:39,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:23:39,088 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:23:39,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:23:39,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:23:39,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:23:39,089 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:23:39,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:23:39,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:23:39,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:23:39,089 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:23:39,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:23:39,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:23:39,090 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:23:39,090 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:23:39,090 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:23:39,090 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 11:23:39,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:23:39,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:23:39,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:23:39,330 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:23:39,335 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:23:39,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_8.c [2022-04-27 11:23:39,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ada08b2e0/68ed42cd15824ce5b0f1ff7b0361aef2/FLAG6369e997a [2022-04-27 11:23:39,717 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:23:39,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_8.c [2022-04-27 11:23:39,723 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ada08b2e0/68ed42cd15824ce5b0f1ff7b0361aef2/FLAG6369e997a [2022-04-27 11:23:39,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ada08b2e0/68ed42cd15824ce5b0f1ff7b0361aef2 [2022-04-27 11:23:39,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:23:39,743 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:23:39,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:23:39,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:23:39,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:23:39,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:23:39" (1/1) ... [2022-04-27 11:23:39,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e122fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39, skipping insertion in model container [2022-04-27 11:23:39,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:23:39" (1/1) ... [2022-04-27 11:23:39,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:23:39,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:23:39,859 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-crafted-1/mono-crafted_8.c[318,331] [2022-04-27 11:23:39,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:23:39,891 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:23:39,904 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-crafted-1/mono-crafted_8.c[318,331] [2022-04-27 11:23:39,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:23:39,918 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:23:39,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39 WrapperNode [2022-04-27 11:23:39,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:23:39,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:23:39,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:23:39,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:23:39,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (1/1) ... [2022-04-27 11:23:39,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (1/1) ... [2022-04-27 11:23:39,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (1/1) ... [2022-04-27 11:23:39,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (1/1) ... [2022-04-27 11:23:39,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (1/1) ... [2022-04-27 11:23:39,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (1/1) ... [2022-04-27 11:23:39,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (1/1) ... [2022-04-27 11:23:39,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:23:39,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:23:39,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:23:39,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:23:39,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (1/1) ... [2022-04-27 11:23:39,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:23:39,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:23:39,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 11:23:39,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 11:23:40,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:23:40,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:23:40,012 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:23:40,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:23:40,012 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:23:40,012 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:23:40,012 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:23:40,012 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:23:40,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:23:40,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:23:40,013 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:23:40,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:23:40,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:23:40,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:23:40,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:23:40,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:23:40,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:23:40,054 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:23:40,055 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:23:40,170 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:23:40,175 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:23:40,175 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:23:40,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:23:40 BoogieIcfgContainer [2022-04-27 11:23:40,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:23:40,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:23:40,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:23:40,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:23:40,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:23:39" (1/3) ... [2022-04-27 11:23:40,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d9dd9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:23:40, skipping insertion in model container [2022-04-27 11:23:40,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (2/3) ... [2022-04-27 11:23:40,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d9dd9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:23:40, skipping insertion in model container [2022-04-27 11:23:40,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:23:40" (3/3) ... [2022-04-27 11:23:40,193 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_8.c [2022-04-27 11:23:40,204 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:23:40,204 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:23:40,241 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:23:40,253 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1ae75bb9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50ab8167 [2022-04-27 11:23:40,253 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:23:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:23:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:23:40,265 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:23:40,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:23:40,266 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:23:40,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:23:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 1 times [2022-04-27 11:23:40,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:23:40,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401895169] [2022-04-27 11:23:40,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:23:40,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:23:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:40,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:23:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:40,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-27 11:23:40,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 11:23:40,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2022-04-27 11:23:40,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:23:40,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-27 11:23:40,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 11:23:40,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2022-04-27 11:23:40,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2022-04-27 11:23:40,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {24#true} is VALID [2022-04-27 11:23:40,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-27 11:23:40,387 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {25#false} is VALID [2022-04-27 11:23:40,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-27 11:23:40,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-27 11:23:40,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-27 11:23:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:23:40,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:23:40,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401895169] [2022-04-27 11:23:40,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401895169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:23:40,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:23:40,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:23:40,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738690200] [2022-04-27 11:23:40,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:23:40,394 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:23:40,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:23:40,397 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:23:40,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:23:40,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:23:40,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:23:40,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:23:40,424 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:40,493 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-27 11:23:40,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:23:40,494 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:23:40,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:23:40,495 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 11:23:40,499 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 11:23:40,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-27 11:23:40,542 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-27 11:23:40,546 INFO L225 Difference]: With dead ends: 33 [2022-04-27 11:23:40,546 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 11:23:40,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:23:40,550 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:23:40,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:23:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 11:23:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 11:23:40,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:23:40,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,570 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,570 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:40,576 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 11:23:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 11:23:40,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:40,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:40,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 11:23:40,577 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 11:23:40,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:40,581 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 11:23:40,581 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 11:23:40,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:40,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:40,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:23:40,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:23:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 11:23:40,585 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-27 11:23:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:23:40,585 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 11:23:40,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 11:23:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:23:40,587 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:23:40,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:23:40,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:23:40,590 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:23:40,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:23:40,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 1 times [2022-04-27 11:23:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:23:40,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567751167] [2022-04-27 11:23:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:23:40,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:23:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:40,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:23:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:40,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {129#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {123#true} is VALID [2022-04-27 11:23:40,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} assume true; {123#true} is VALID [2022-04-27 11:23:40,734 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123#true} {123#true} #42#return; {123#true} is VALID [2022-04-27 11:23:40,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {123#true} call ULTIMATE.init(); {129#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:23:40,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {123#true} is VALID [2022-04-27 11:23:40,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} assume true; {123#true} is VALID [2022-04-27 11:23:40,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123#true} {123#true} #42#return; {123#true} is VALID [2022-04-27 11:23:40,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {123#true} call #t~ret6 := main(); {123#true} is VALID [2022-04-27 11:23:40,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {123#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {128#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:40,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {124#false} is VALID [2022-04-27 11:23:40,738 INFO L272 TraceCheckUtils]: 7: Hoare triple {124#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {124#false} is VALID [2022-04-27 11:23:40,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {124#false} ~cond := #in~cond; {124#false} is VALID [2022-04-27 11:23:40,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {124#false} assume 0 == ~cond; {124#false} is VALID [2022-04-27 11:23:40,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {124#false} assume !false; {124#false} is VALID [2022-04-27 11:23:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:23:40,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:23:40,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567751167] [2022-04-27 11:23:40,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567751167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:23:40,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:23:40,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:23:40,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586252495] [2022-04-27 11:23:40,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:23:40,741 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:23:40,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:23:40,741 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:23:40,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:23:40,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:23:40,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:23:40,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:23:40,760 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:40,887 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 11:23:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:23:40,887 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:23:40,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:23:40,888 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-27 11:23:40,890 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-27 11:23:40,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-04-27 11:23:40,921 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-27 11:23:40,923 INFO L225 Difference]: With dead ends: 25 [2022-04-27 11:23:40,923 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 11:23:40,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:23:40,929 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:23:40,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:23:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 11:23:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-27 11:23:40,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:23:40,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,940 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,940 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:40,942 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 11:23:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 11:23:40,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:40,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:40,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:23:40,943 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:23:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:40,945 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 11:23:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 11:23:40,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:40,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:40,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:23:40,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:23:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-27 11:23:40,947 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-27 11:23:40,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:23:40,948 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-27 11:23:40,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 11:23:40,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:23:40,949 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:23:40,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:23:40,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:23:40,950 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:23:40,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:23:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash -79339060, now seen corresponding path program 1 times [2022-04-27 11:23:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:23:40,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257324585] [2022-04-27 11:23:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:23:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:23:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:41,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:23:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:41,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {228#true} is VALID [2022-04-27 11:23:41,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-27 11:23:41,135 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} #42#return; {228#true} is VALID [2022-04-27 11:23:41,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:23:41,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {228#true} is VALID [2022-04-27 11:23:41,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-27 11:23:41,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #42#return; {228#true} is VALID [2022-04-27 11:23:41,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret6 := main(); {228#true} is VALID [2022-04-27 11:23:41,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {233#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:41,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {233#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {234#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:41,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {234#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:41,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {235#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-27 11:23:41,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999999 main_~x~0) main_~y~0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {229#false} is VALID [2022-04-27 11:23:41,139 INFO L272 TraceCheckUtils]: 10: Hoare triple {229#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {229#false} is VALID [2022-04-27 11:23:41,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#false} ~cond := #in~cond; {229#false} is VALID [2022-04-27 11:23:41,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {229#false} assume 0 == ~cond; {229#false} is VALID [2022-04-27 11:23:41,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} assume !false; {229#false} is VALID [2022-04-27 11:23:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:23:41,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:23:41,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257324585] [2022-04-27 11:23:41,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257324585] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:23:41,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024316123] [2022-04-27 11:23:41,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:23:41,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:23:41,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:23:41,143 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:23:41,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 11:23:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:41,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:23:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:41,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:23:41,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {228#true} is VALID [2022-04-27 11:23:41,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#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(17, 2);call #Ultimate.allocInit(12, 3); {228#true} is VALID [2022-04-27 11:23:41,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-27 11:23:41,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #42#return; {228#true} is VALID [2022-04-27 11:23:41,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret6 := main(); {228#true} is VALID [2022-04-27 11:23:41,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {233#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:41,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {233#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {233#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:41,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {233#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:41,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {233#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {264#(and (= (+ (- 1) main_~x~0) 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:41,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(and (= (+ (- 1) main_~x~0) 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {229#false} is VALID [2022-04-27 11:23:41,475 INFO L272 TraceCheckUtils]: 10: Hoare triple {229#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {229#false} is VALID [2022-04-27 11:23:41,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#false} ~cond := #in~cond; {229#false} is VALID [2022-04-27 11:23:41,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {229#false} assume 0 == ~cond; {229#false} is VALID [2022-04-27 11:23:41,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} assume !false; {229#false} is VALID [2022-04-27 11:23:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:23:41,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:23:41,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} assume !false; {229#false} is VALID [2022-04-27 11:23:41,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {229#false} assume 0 == ~cond; {229#false} is VALID [2022-04-27 11:23:41,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#false} ~cond := #in~cond; {229#false} is VALID [2022-04-27 11:23:41,549 INFO L272 TraceCheckUtils]: 10: Hoare triple {229#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {229#false} is VALID [2022-04-27 11:23:41,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {292#(< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {229#false} is VALID [2022-04-27 11:23:41,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {296#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {292#(< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:41,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {296#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:41,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {296#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {296#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:41,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {296#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:41,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret6 := main(); {228#true} is VALID [2022-04-27 11:23:41,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #42#return; {228#true} is VALID [2022-04-27 11:23:41,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-27 11:23:41,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#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(17, 2);call #Ultimate.allocInit(12, 3); {228#true} is VALID [2022-04-27 11:23:41,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {228#true} is VALID [2022-04-27 11:23:41,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:23:41,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024316123] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:23:41,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:23:41,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-04-27 11:23:41,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625237091] [2022-04-27 11:23:41,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:23:41,554 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), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:23:41,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:23:41,555 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), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:41,572 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-27 11:23:41,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 11:23:41,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:23:41,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 11:23:41,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:23:41,575 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:41,746 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-27 11:23:41,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:23:41,747 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), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:23:41,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:23:41,747 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), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-27 11:23:41,748 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), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-27 11:23:41,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2022-04-27 11:23:41,782 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-27 11:23:41,783 INFO L225 Difference]: With dead ends: 32 [2022-04-27 11:23:41,783 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 11:23:41,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:23:41,784 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:23:41,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 28 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:23:41,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 11:23:41,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 11:23:41,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:23:41,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:41,793 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:41,793 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:41,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:41,794 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 11:23:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 11:23:41,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:41,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:41,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-27 11:23:41,795 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-27 11:23:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:41,796 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 11:23:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 11:23:41,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:41,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:41,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:23:41,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:23:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-27 11:23:41,797 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2022-04-27 11:23:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:23:41,797 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-27 11:23:41,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 11:23:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:23:41,798 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:23:41,798 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:23:41,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 11:23:42,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:23:42,016 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:23:42,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:23:42,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1341602340, now seen corresponding path program 1 times [2022-04-27 11:23:42,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:23:42,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039608292] [2022-04-27 11:23:42,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:23:42,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:23:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:42,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:23:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:42,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {460#true} is VALID [2022-04-27 11:23:42,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:23:42,131 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {460#true} {460#true} #42#return; {460#true} is VALID [2022-04-27 11:23:42,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {460#true} call ULTIMATE.init(); {468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:23:42,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {460#true} is VALID [2022-04-27 11:23:42,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:23:42,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} #42#return; {460#true} is VALID [2022-04-27 11:23:42,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {460#true} call #t~ret6 := main(); {460#true} is VALID [2022-04-27 11:23:42,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {465#(= main_~x~0 0)} is VALID [2022-04-27 11:23:42,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {465#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {465#(= main_~x~0 0)} is VALID [2022-04-27 11:23:42,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {465#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {465#(= main_~x~0 0)} is VALID [2022-04-27 11:23:42,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {465#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:42,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:42,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:42,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {467#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:42,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {467#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {467#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:42,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {467#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {461#false} is VALID [2022-04-27 11:23:42,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {461#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {461#false} is VALID [2022-04-27 11:23:42,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {461#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {461#false} is VALID [2022-04-27 11:23:42,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {461#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {461#false} is VALID [2022-04-27 11:23:42,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {461#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {461#false} is VALID [2022-04-27 11:23:42,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {461#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {461#false} is VALID [2022-04-27 11:23:42,138 INFO L272 TraceCheckUtils]: 19: Hoare triple {461#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {461#false} is VALID [2022-04-27 11:23:42,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {461#false} ~cond := #in~cond; {461#false} is VALID [2022-04-27 11:23:42,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {461#false} assume 0 == ~cond; {461#false} is VALID [2022-04-27 11:23:42,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-04-27 11:23:42,141 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:23:42,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:23:42,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039608292] [2022-04-27 11:23:42,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039608292] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:23:42,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111204294] [2022-04-27 11:23:42,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:23:42,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:23:42,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:23:42,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:23:42,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 11:23:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:42,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:23:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:42,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:23:42,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {460#true} call ULTIMATE.init(); {460#true} is VALID [2022-04-27 11:23:42,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#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(17, 2);call #Ultimate.allocInit(12, 3); {460#true} is VALID [2022-04-27 11:23:42,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:23:42,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} #42#return; {460#true} is VALID [2022-04-27 11:23:42,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {460#true} call #t~ret6 := main(); {460#true} is VALID [2022-04-27 11:23:42,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {465#(= main_~x~0 0)} is VALID [2022-04-27 11:23:42,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {465#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {465#(= main_~x~0 0)} is VALID [2022-04-27 11:23:42,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {465#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {465#(= main_~x~0 0)} is VALID [2022-04-27 11:23:42,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {465#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:42,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:42,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:42,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {505#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:42,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {505#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {505#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:42,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {505#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {461#false} is VALID [2022-04-27 11:23:42,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {461#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {461#false} is VALID [2022-04-27 11:23:42,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {461#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {461#false} is VALID [2022-04-27 11:23:42,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {461#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {461#false} is VALID [2022-04-27 11:23:42,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {461#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {461#false} is VALID [2022-04-27 11:23:42,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {461#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {461#false} is VALID [2022-04-27 11:23:42,463 INFO L272 TraceCheckUtils]: 19: Hoare triple {461#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {461#false} is VALID [2022-04-27 11:23:42,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {461#false} ~cond := #in~cond; {461#false} is VALID [2022-04-27 11:23:42,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {461#false} assume 0 == ~cond; {461#false} is VALID [2022-04-27 11:23:42,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-04-27 11:23:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:23:42,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:23:42,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-04-27 11:23:42,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {461#false} assume 0 == ~cond; {461#false} is VALID [2022-04-27 11:23:42,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {461#false} ~cond := #in~cond; {461#false} is VALID [2022-04-27 11:23:42,713 INFO L272 TraceCheckUtils]: 19: Hoare triple {461#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {461#false} is VALID [2022-04-27 11:23:42,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {461#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {461#false} is VALID [2022-04-27 11:23:42,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {461#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {461#false} is VALID [2022-04-27 11:23:42,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {461#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {461#false} is VALID [2022-04-27 11:23:42,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {461#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {461#false} is VALID [2022-04-27 11:23:42,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {461#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {461#false} is VALID [2022-04-27 11:23:42,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {566#(not (<= 5000000 (mod main_~x~0 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {461#false} is VALID [2022-04-27 11:23:42,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {570#(or (<= 4294967295 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {566#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:23:42,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {574#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {570#(or (<= 4294967295 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 11:23:42,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {574#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {574#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:23:42,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {574#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {574#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:23:42,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {584#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {574#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:23:42,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {584#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {584#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-27 11:23:42,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {584#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-27 11:23:42,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {584#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-27 11:23:42,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {460#true} call #t~ret6 := main(); {460#true} is VALID [2022-04-27 11:23:42,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} #42#return; {460#true} is VALID [2022-04-27 11:23:42,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:23:42,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#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(17, 2);call #Ultimate.allocInit(12, 3); {460#true} is VALID [2022-04-27 11:23:42,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {460#true} call ULTIMATE.init(); {460#true} is VALID [2022-04-27 11:23:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:23:42,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111204294] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:23:42,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:23:42,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-04-27 11:23:42,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289651949] [2022-04-27 11:23:42,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:23:42,723 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:23:42,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:23:42,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:42,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:23:42,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 11:23:42,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:23:42,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 11:23:42,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:23:42,778 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:43,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:43,082 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-27 11:23:43,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:23:43,082 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:23:43,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:23:43,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:43,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 11:23:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 11:23:43,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-27 11:23:43,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:23:43,165 INFO L225 Difference]: With dead ends: 44 [2022-04-27 11:23:43,165 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 11:23:43,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:23:43,176 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:23:43,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 28 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:23:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 11:23:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-27 11:23:43,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:23:43,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:43,195 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:43,195 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:43,204 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 11:23:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-27 11:23:43,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:43,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:43,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-27 11:23:43,206 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-27 11:23:43,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:43,213 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 11:23:43,213 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-27 11:23:43,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:43,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:43,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:23:43,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:23:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-27 11:23:43,214 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2022-04-27 11:23:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:23:43,215 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-27 11:23:43,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 11:23:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:23:43,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:23:43,215 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:23:43,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 11:23:43,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 11:23:43,423 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:23:43,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:23:43,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1571384604, now seen corresponding path program 2 times [2022-04-27 11:23:43,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:23:43,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524832068] [2022-04-27 11:23:43,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:23:43,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:23:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:43,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:23:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:43,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {798#true} is VALID [2022-04-27 11:23:43,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {798#true} assume true; {798#true} is VALID [2022-04-27 11:23:43,586 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {798#true} {798#true} #42#return; {798#true} is VALID [2022-04-27 11:23:43,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {798#true} call ULTIMATE.init(); {809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:23:43,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {798#true} is VALID [2022-04-27 11:23:43,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {798#true} assume true; {798#true} is VALID [2022-04-27 11:23:43,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {798#true} {798#true} #42#return; {798#true} is VALID [2022-04-27 11:23:43,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {798#true} call #t~ret6 := main(); {798#true} is VALID [2022-04-27 11:23:43,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {798#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {803#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:43,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {803#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {804#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:43,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {804#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {804#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:43,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {804#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {805#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:43,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {805#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {805#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:43,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {805#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {805#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:43,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {805#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {806#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:43,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {806#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {806#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:43,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {806#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {806#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:43,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {806#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {807#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:43,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {807#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {807#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:43,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {807#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {807#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:43,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {807#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {808#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999996 main_~x~0) main_~y~0))} is VALID [2022-04-27 11:23:43,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {808#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999996 main_~x~0) main_~y~0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {799#false} is VALID [2022-04-27 11:23:43,595 INFO L272 TraceCheckUtils]: 19: Hoare triple {799#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {799#false} is VALID [2022-04-27 11:23:43,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {799#false} ~cond := #in~cond; {799#false} is VALID [2022-04-27 11:23:43,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {799#false} assume 0 == ~cond; {799#false} is VALID [2022-04-27 11:23:43,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {799#false} assume !false; {799#false} is VALID [2022-04-27 11:23:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:23:43,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:23:43,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524832068] [2022-04-27 11:23:43,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524832068] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:23:43,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351475864] [2022-04-27 11:23:43,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:23:43,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:23:43,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:23:43,607 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:23:43,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 11:23:43,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:23:43,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:23:43,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 11:23:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:43,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:23:44,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {798#true} call ULTIMATE.init(); {798#true} is VALID [2022-04-27 11:23:44,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {798#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(17, 2);call #Ultimate.allocInit(12, 3); {798#true} is VALID [2022-04-27 11:23:44,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {798#true} assume true; {798#true} is VALID [2022-04-27 11:23:44,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {798#true} {798#true} #42#return; {798#true} is VALID [2022-04-27 11:23:44,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {798#true} call #t~ret6 := main(); {798#true} is VALID [2022-04-27 11:23:44,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {798#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {803#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:44,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {803#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {803#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:44,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {803#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {803#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:44,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {803#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {837#(and (= main_~x~0 1) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:44,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {837#(and (= main_~x~0 1) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {837#(and (= main_~x~0 1) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:44,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {837#(and (= main_~x~0 1) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {837#(and (= main_~x~0 1) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:44,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {837#(and (= main_~x~0 1) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {847#(and (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (= main_~x~0 2))} is VALID [2022-04-27 11:23:44,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {847#(and (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {847#(and (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (= main_~x~0 2))} is VALID [2022-04-27 11:23:44,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {847#(and (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {847#(and (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (= main_~x~0 2))} is VALID [2022-04-27 11:23:44,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {847#(and (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {857#(and (= main_~x~0 3) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:44,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {857#(and (= main_~x~0 3) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {857#(and (= main_~x~0 3) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:44,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {857#(and (= main_~x~0 3) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {857#(and (= main_~x~0 3) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:44,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {857#(and (= main_~x~0 3) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {867#(and (= (+ (- 1) main_~x~0) 3) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:44,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {867#(and (= (+ (- 1) main_~x~0) 3) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {799#false} is VALID [2022-04-27 11:23:44,021 INFO L272 TraceCheckUtils]: 19: Hoare triple {799#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {799#false} is VALID [2022-04-27 11:23:44,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {799#false} ~cond := #in~cond; {799#false} is VALID [2022-04-27 11:23:44,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {799#false} assume 0 == ~cond; {799#false} is VALID [2022-04-27 11:23:44,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {799#false} assume !false; {799#false} is VALID [2022-04-27 11:23:44,021 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:23:44,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:23:44,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {799#false} assume !false; {799#false} is VALID [2022-04-27 11:23:44,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {799#false} assume 0 == ~cond; {799#false} is VALID [2022-04-27 11:23:44,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {799#false} ~cond := #in~cond; {799#false} is VALID [2022-04-27 11:23:44,178 INFO L272 TraceCheckUtils]: 19: Hoare triple {799#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {799#false} is VALID [2022-04-27 11:23:44,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {895#(< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {799#false} is VALID [2022-04-27 11:23:44,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {899#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {895#(< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:44,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {899#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {899#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:44,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {899#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {899#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:44,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {909#(< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {899#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:44,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {909#(< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {909#(< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:44,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {909#(< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {909#(< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:44,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {919#(< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {909#(< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:44,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {919#(< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {919#(< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:44,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {919#(< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {919#(< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:44,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {929#(< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {919#(< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:44,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {929#(< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {929#(< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:44,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {929#(< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {929#(< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:44,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {798#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {929#(< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:44,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {798#true} call #t~ret6 := main(); {798#true} is VALID [2022-04-27 11:23:44,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {798#true} {798#true} #42#return; {798#true} is VALID [2022-04-27 11:23:44,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {798#true} assume true; {798#true} is VALID [2022-04-27 11:23:44,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {798#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(17, 2);call #Ultimate.allocInit(12, 3); {798#true} is VALID [2022-04-27 11:23:44,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {798#true} call ULTIMATE.init(); {798#true} is VALID [2022-04-27 11:23:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:23:44,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351475864] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:23:44,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:23:44,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2022-04-27 11:23:44,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758338289] [2022-04-27 11:23:44,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:23:44,189 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:23:44,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:23:44,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:44,230 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-27 11:23:44,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 11:23:44,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:23:44,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 11:23:44,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:23:44,231 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:44,983 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-04-27 11:23:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 11:23:44,983 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:23:44,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:23:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-27 11:23:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-27 11:23:44,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-27 11:23:45,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:23:45,032 INFO L225 Difference]: With dead ends: 47 [2022-04-27 11:23:45,032 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 11:23:45,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2022-04-27 11:23:45,033 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 62 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:23:45,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 38 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:23:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 11:23:45,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-27 11:23:45,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:23:45,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:45,053 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:45,053 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:45,054 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-27 11:23:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-27 11:23:45,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:45,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:45,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-27 11:23:45,055 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-27 11:23:45,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:45,056 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-27 11:23:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-27 11:23:45,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:45,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:45,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:23:45,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:23:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-27 11:23:45,057 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 23 [2022-04-27 11:23:45,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:23:45,057 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-27 11:23:45,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-27 11:23:45,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 11:23:45,058 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:23:45,058 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:23:45,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 11:23:45,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:23:45,259 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:23:45,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:23:45,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1427761564, now seen corresponding path program 2 times [2022-04-27 11:23:45,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:23:45,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557632930] [2022-04-27 11:23:45,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:23:45,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:23:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:45,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:23:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:45,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {1197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1185#true} is VALID [2022-04-27 11:23:45,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {1185#true} assume true; {1185#true} is VALID [2022-04-27 11:23:45,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1185#true} {1185#true} #42#return; {1185#true} is VALID [2022-04-27 11:23:45,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {1185#true} call ULTIMATE.init(); {1197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:23:45,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {1197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1185#true} is VALID [2022-04-27 11:23:45,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {1185#true} assume true; {1185#true} is VALID [2022-04-27 11:23:45,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1185#true} {1185#true} #42#return; {1185#true} is VALID [2022-04-27 11:23:45,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {1185#true} call #t~ret6 := main(); {1185#true} is VALID [2022-04-27 11:23:45,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {1185#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1190#(= main_~x~0 0)} is VALID [2022-04-27 11:23:45,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {1190#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1190#(= main_~x~0 0)} is VALID [2022-04-27 11:23:45,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {1190#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {1190#(= main_~x~0 0)} is VALID [2022-04-27 11:23:45,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {1190#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:45,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:45,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:45,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:45,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:45,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:45,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:23:45,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:23:45,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:23:45,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:23:45,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:23:45,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:23:45,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:23:45,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:23:45,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:23:45,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1196#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-27 11:23:45,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {1196#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1196#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-27 11:23:45,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {1196#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1186#false} is VALID [2022-04-27 11:23:45,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {1186#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1186#false} is VALID [2022-04-27 11:23:45,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {1186#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1186#false} is VALID [2022-04-27 11:23:45,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {1186#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1186#false} is VALID [2022-04-27 11:23:45,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {1186#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1186#false} is VALID [2022-04-27 11:23:45,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {1186#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1186#false} is VALID [2022-04-27 11:23:45,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {1186#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1186#false} is VALID [2022-04-27 11:23:45,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {1186#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1186#false} is VALID [2022-04-27 11:23:45,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {1186#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1186#false} is VALID [2022-04-27 11:23:45,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {1186#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1186#false} is VALID [2022-04-27 11:23:45,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {1186#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1186#false} is VALID [2022-04-27 11:23:45,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {1186#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1186#false} is VALID [2022-04-27 11:23:45,424 INFO L272 TraceCheckUtils]: 37: Hoare triple {1186#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {1186#false} is VALID [2022-04-27 11:23:45,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {1186#false} ~cond := #in~cond; {1186#false} is VALID [2022-04-27 11:23:45,425 INFO L290 TraceCheckUtils]: 39: Hoare triple {1186#false} assume 0 == ~cond; {1186#false} is VALID [2022-04-27 11:23:45,425 INFO L290 TraceCheckUtils]: 40: Hoare triple {1186#false} assume !false; {1186#false} is VALID [2022-04-27 11:23:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:23:45,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:23:45,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557632930] [2022-04-27 11:23:45,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557632930] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:23:45,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130275110] [2022-04-27 11:23:45,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:23:45,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:23:45,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:23:45,440 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:23:45,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 11:23:45,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:23:45,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:23:45,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 11:23:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:45,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:23:45,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {1185#true} call ULTIMATE.init(); {1185#true} is VALID [2022-04-27 11:23:45,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {1185#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(17, 2);call #Ultimate.allocInit(12, 3); {1185#true} is VALID [2022-04-27 11:23:45,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {1185#true} assume true; {1185#true} is VALID [2022-04-27 11:23:45,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1185#true} {1185#true} #42#return; {1185#true} is VALID [2022-04-27 11:23:45,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {1185#true} call #t~ret6 := main(); {1185#true} is VALID [2022-04-27 11:23:45,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {1185#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1190#(= main_~x~0 0)} is VALID [2022-04-27 11:23:45,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {1190#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1190#(= main_~x~0 0)} is VALID [2022-04-27 11:23:45,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {1190#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {1190#(= main_~x~0 0)} is VALID [2022-04-27 11:23:45,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {1190#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:45,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:45,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:45,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:45,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:45,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:45,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:23:45,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:23:45,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:23:45,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:23:45,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:23:45,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:23:45,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:23:45,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:23:45,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:23:45,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1270#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:23:45,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {1270#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1270#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:23:45,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {1270#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1186#false} is VALID [2022-04-27 11:23:45,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {1186#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1186#false} is VALID [2022-04-27 11:23:45,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {1186#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1186#false} is VALID [2022-04-27 11:23:45,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {1186#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1186#false} is VALID [2022-04-27 11:23:45,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {1186#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1186#false} is VALID [2022-04-27 11:23:45,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {1186#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1186#false} is VALID [2022-04-27 11:23:45,759 INFO L290 TraceCheckUtils]: 31: Hoare triple {1186#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1186#false} is VALID [2022-04-27 11:23:45,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {1186#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1186#false} is VALID [2022-04-27 11:23:45,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {1186#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1186#false} is VALID [2022-04-27 11:23:45,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {1186#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1186#false} is VALID [2022-04-27 11:23:45,759 INFO L290 TraceCheckUtils]: 35: Hoare triple {1186#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1186#false} is VALID [2022-04-27 11:23:45,759 INFO L290 TraceCheckUtils]: 36: Hoare triple {1186#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1186#false} is VALID [2022-04-27 11:23:45,759 INFO L272 TraceCheckUtils]: 37: Hoare triple {1186#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {1186#false} is VALID [2022-04-27 11:23:45,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {1186#false} ~cond := #in~cond; {1186#false} is VALID [2022-04-27 11:23:45,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {1186#false} assume 0 == ~cond; {1186#false} is VALID [2022-04-27 11:23:45,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {1186#false} assume !false; {1186#false} is VALID [2022-04-27 11:23:45,760 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:23:45,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:23:45,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {1186#false} assume !false; {1186#false} is VALID [2022-04-27 11:23:45,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {1186#false} assume 0 == ~cond; {1186#false} is VALID [2022-04-27 11:23:45,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {1186#false} ~cond := #in~cond; {1186#false} is VALID [2022-04-27 11:23:45,975 INFO L272 TraceCheckUtils]: 37: Hoare triple {1186#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {1186#false} is VALID [2022-04-27 11:23:45,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {1186#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1186#false} is VALID [2022-04-27 11:23:45,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {1186#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1186#false} is VALID [2022-04-27 11:23:45,975 INFO L290 TraceCheckUtils]: 34: Hoare triple {1186#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1186#false} is VALID [2022-04-27 11:23:45,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {1186#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1186#false} is VALID [2022-04-27 11:23:45,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {1186#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1186#false} is VALID [2022-04-27 11:23:45,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {1186#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1186#false} is VALID [2022-04-27 11:23:45,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {1186#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1186#false} is VALID [2022-04-27 11:23:45,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {1186#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1186#false} is VALID [2022-04-27 11:23:45,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {1186#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1186#false} is VALID [2022-04-27 11:23:45,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {1186#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1186#false} is VALID [2022-04-27 11:23:45,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {1186#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1186#false} is VALID [2022-04-27 11:23:45,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {1367#(not (<= 5000000 (mod main_~x~0 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1186#false} is VALID [2022-04-27 11:23:45,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {1367#(not (<= 5000000 (mod main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1367#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:23:45,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {1374#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1367#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:23:45,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {1374#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {1374#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:23:45,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {1374#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1374#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:23:45,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {1384#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1374#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:23:45,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {1384#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {1384#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 11:23:45,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {1384#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1384#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 11:23:45,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {1394#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1384#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 11:23:45,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {1394#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {1394#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-27 11:23:45,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {1394#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1394#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-27 11:23:45,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {1404#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1394#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-27 11:23:45,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {1404#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {1404#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 11:23:45,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {1404#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1404#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 11:23:45,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {1414#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1404#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 11:23:45,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {1414#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {1414#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:23:45,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {1414#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1414#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:23:45,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {1424#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1414#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:23:45,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {1424#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {1424#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 11:23:45,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {1424#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1424#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 11:23:45,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {1185#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1424#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 11:23:45,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {1185#true} call #t~ret6 := main(); {1185#true} is VALID [2022-04-27 11:23:45,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1185#true} {1185#true} #42#return; {1185#true} is VALID [2022-04-27 11:23:45,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {1185#true} assume true; {1185#true} is VALID [2022-04-27 11:23:45,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {1185#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(17, 2);call #Ultimate.allocInit(12, 3); {1185#true} is VALID [2022-04-27 11:23:45,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {1185#true} call ULTIMATE.init(); {1185#true} is VALID [2022-04-27 11:23:45,987 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:23:45,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130275110] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:23:45,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:23:45,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-27 11:23:45,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492418720] [2022-04-27 11:23:45,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:23:45,988 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 11:23:45,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:23:45,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:46,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:23:46,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 11:23:46,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:23:46,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 11:23:46,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:23:46,030 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:47,122 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2022-04-27 11:23:47,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 11:23:47,123 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 11:23:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:23:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-27 11:23:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-27 11:23:47,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2022-04-27 11:23:47,229 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-27 11:23:47,230 INFO L225 Difference]: With dead ends: 76 [2022-04-27 11:23:47,230 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 11:23:47,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=299, Invalid=693, Unknown=0, NotChecked=0, Total=992 [2022-04-27 11:23:47,231 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 71 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:23:47,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 58 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:23:47,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 11:23:47,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2022-04-27 11:23:47,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:23:47,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:47,266 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:47,267 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:47,268 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-04-27 11:23:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-04-27 11:23:47,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:47,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:47,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-27 11:23:47,269 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-27 11:23:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:47,270 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-04-27 11:23:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-04-27 11:23:47,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:47,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:47,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:23:47,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:23:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-04-27 11:23:47,272 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 41 [2022-04-27 11:23:47,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:23:47,272 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-04-27 11:23:47,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-04-27 11:23:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 11:23:47,273 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:23:47,273 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:23:47,295 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-27 11:23:47,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:23:47,487 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:23:47,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:23:47,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1653655580, now seen corresponding path program 3 times [2022-04-27 11:23:47,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:23:47,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724981163] [2022-04-27 11:23:47,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:23:47,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:23:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:47,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:23:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:47,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {1799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1782#true} is VALID [2022-04-27 11:23:47,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {1782#true} assume true; {1782#true} is VALID [2022-04-27 11:23:47,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1782#true} {1782#true} #42#return; {1782#true} is VALID [2022-04-27 11:23:47,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {1782#true} call ULTIMATE.init(); {1799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:23:47,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {1799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1782#true} is VALID [2022-04-27 11:23:47,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {1782#true} assume true; {1782#true} is VALID [2022-04-27 11:23:47,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1782#true} {1782#true} #42#return; {1782#true} is VALID [2022-04-27 11:23:47,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {1782#true} call #t~ret6 := main(); {1782#true} is VALID [2022-04-27 11:23:47,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {1782#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1787#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:23:47,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {1787#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1788#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {1788#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {1788#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {1788#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1789#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {1789#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1789#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {1789#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {1789#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {1789#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1790#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {1790#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1790#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {1790#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {1790#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {1790#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1791#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {1791#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1791#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {1791#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {1791#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {1791#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1792#(and (<= (+ 9999996 main_~x~0) main_~y~0) (<= 4 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {1792#(and (<= (+ 9999996 main_~x~0) main_~y~0) (<= 4 main_~x~0) (<= (div main_~y~0 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1792#(and (<= (+ 9999996 main_~x~0) main_~y~0) (<= 4 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {1792#(and (<= (+ 9999996 main_~x~0) main_~y~0) (<= 4 main_~x~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {1792#(and (<= (+ 9999996 main_~x~0) main_~y~0) (<= 4 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {1792#(and (<= (+ 9999996 main_~x~0) main_~y~0) (<= 4 main_~x~0) (<= (div main_~y~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1793#(and (<= (+ main_~x~0 9999995) main_~y~0) (<= 5 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {1793#(and (<= (+ main_~x~0 9999995) main_~y~0) (<= 5 main_~x~0) (<= (div main_~y~0 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1793#(and (<= (+ main_~x~0 9999995) main_~y~0) (<= 5 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#(and (<= (+ main_~x~0 9999995) main_~y~0) (<= 5 main_~x~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {1793#(and (<= (+ main_~x~0 9999995) main_~y~0) (<= 5 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#(and (<= (+ main_~x~0 9999995) main_~y~0) (<= 5 main_~x~0) (<= (div main_~y~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1794#(and (<= 6 main_~x~0) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~x~0 9999994) main_~y~0))} is VALID [2022-04-27 11:23:47,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {1794#(and (<= 6 main_~x~0) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~x~0 9999994) main_~y~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1794#(and (<= 6 main_~x~0) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~x~0 9999994) main_~y~0))} is VALID [2022-04-27 11:23:47,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {1794#(and (<= 6 main_~x~0) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~x~0 9999994) main_~y~0))} assume !(~x~0 % 4294967296 >= 5000000); {1794#(and (<= 6 main_~x~0) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~x~0 9999994) main_~y~0))} is VALID [2022-04-27 11:23:47,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {1794#(and (<= 6 main_~x~0) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~x~0 9999994) main_~y~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1795#(and (<= (+ main_~x~0 9999993) main_~y~0) (<= (div main_~y~0 4294967296) 0) (<= 7 main_~x~0))} is VALID [2022-04-27 11:23:47,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {1795#(and (<= (+ main_~x~0 9999993) main_~y~0) (<= (div main_~y~0 4294967296) 0) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1795#(and (<= (+ main_~x~0 9999993) main_~y~0) (<= (div main_~y~0 4294967296) 0) (<= 7 main_~x~0))} is VALID [2022-04-27 11:23:47,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {1795#(and (<= (+ main_~x~0 9999993) main_~y~0) (<= (div main_~y~0 4294967296) 0) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1795#(and (<= (+ main_~x~0 9999993) main_~y~0) (<= (div main_~y~0 4294967296) 0) (<= 7 main_~x~0))} is VALID [2022-04-27 11:23:47,803 INFO L290 TraceCheckUtils]: 29: Hoare triple {1795#(and (<= (+ main_~x~0 9999993) main_~y~0) (<= (div main_~y~0 4294967296) 0) (<= 7 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1796#(and (<= (+ 9999992 main_~x~0) main_~y~0) (<= 8 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,803 INFO L290 TraceCheckUtils]: 30: Hoare triple {1796#(and (<= (+ 9999992 main_~x~0) main_~y~0) (<= 8 main_~x~0) (<= (div main_~y~0 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1796#(and (<= (+ 9999992 main_~x~0) main_~y~0) (<= 8 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,804 INFO L290 TraceCheckUtils]: 31: Hoare triple {1796#(and (<= (+ 9999992 main_~x~0) main_~y~0) (<= 8 main_~x~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {1796#(and (<= (+ 9999992 main_~x~0) main_~y~0) (<= 8 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {1796#(and (<= (+ 9999992 main_~x~0) main_~y~0) (<= 8 main_~x~0) (<= (div main_~y~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1797#(and (<= 9 main_~x~0) (<= (+ main_~x~0 9999991) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {1797#(and (<= 9 main_~x~0) (<= (+ main_~x~0 9999991) main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1797#(and (<= 9 main_~x~0) (<= (+ main_~x~0 9999991) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {1797#(and (<= 9 main_~x~0) (<= (+ main_~x~0 9999991) main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {1797#(and (<= 9 main_~x~0) (<= (+ main_~x~0 9999991) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:23:47,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {1797#(and (<= 9 main_~x~0) (<= (+ main_~x~0 9999991) main_~y~0) (<= (div main_~y~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1798#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999990 main_~x~0) main_~y~0))} is VALID [2022-04-27 11:23:47,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {1798#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999990 main_~x~0) main_~y~0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1783#false} is VALID [2022-04-27 11:23:47,807 INFO L272 TraceCheckUtils]: 37: Hoare triple {1783#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {1783#false} is VALID [2022-04-27 11:23:47,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {1783#false} ~cond := #in~cond; {1783#false} is VALID [2022-04-27 11:23:47,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {1783#false} assume 0 == ~cond; {1783#false} is VALID [2022-04-27 11:23:47,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {1783#false} assume !false; {1783#false} is VALID [2022-04-27 11:23:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:23:47,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:23:47,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724981163] [2022-04-27 11:23:47,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724981163] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:23:47,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010375672] [2022-04-27 11:23:47,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:23:47,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:23:47,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:23:47,809 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:23:47,810 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-27 11:23:47,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 11:23:47,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:23:47,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 11:23:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:47,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:23:48,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {1782#true} call ULTIMATE.init(); {1782#true} is VALID [2022-04-27 11:23:48,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {1782#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(17, 2);call #Ultimate.allocInit(12, 3); {1782#true} is VALID [2022-04-27 11:23:48,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {1782#true} assume true; {1782#true} is VALID [2022-04-27 11:23:48,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1782#true} {1782#true} #42#return; {1782#true} is VALID [2022-04-27 11:23:48,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {1782#true} call #t~ret6 := main(); {1782#true} is VALID [2022-04-27 11:23:48,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {1782#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {1818#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {1818#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {1818#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {1818#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {1818#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {1818#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {1818#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {1818#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {1818#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {1818#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {1818#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {1818#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {1818#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {1818#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {1818#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {1818#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {1818#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {1818#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {1818#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {1818#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {1818#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {1818#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {1818#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {1818#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {1818#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,222 INFO L290 TraceCheckUtils]: 31: Hoare triple {1818#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {1818#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {1818#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1818#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:48,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {1818#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1906#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 11:23:48,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {1906#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1910#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:23:48,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {1910#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1783#false} is VALID [2022-04-27 11:23:48,226 INFO L272 TraceCheckUtils]: 37: Hoare triple {1783#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {1783#false} is VALID [2022-04-27 11:23:48,226 INFO L290 TraceCheckUtils]: 38: Hoare triple {1783#false} ~cond := #in~cond; {1783#false} is VALID [2022-04-27 11:23:48,226 INFO L290 TraceCheckUtils]: 39: Hoare triple {1783#false} assume 0 == ~cond; {1783#false} is VALID [2022-04-27 11:23:48,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {1783#false} assume !false; {1783#false} is VALID [2022-04-27 11:23:48,226 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-04-27 11:23:48,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:23:48,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010375672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:23:48,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:23:48,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-04-27 11:23:48,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499935923] [2022-04-27 11:23:48,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:23:48,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 11:23:48,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:23:48,227 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), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:48,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:23:48,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:23:48,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:23:48,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:23:48,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:23:48,238 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:48,329 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-27 11:23:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:23:48,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 11:23:48,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:23:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-27 11:23:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-27 11:23:48,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-27 11:23:48,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:23:48,352 INFO L225 Difference]: With dead ends: 65 [2022-04-27 11:23:48,352 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 11:23:48,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:23:48,353 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:23:48,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:23:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 11:23:48,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-04-27 11:23:48,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:23:48,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:48,395 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:48,395 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:48,397 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-27 11:23:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-27 11:23:48,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:48,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:48,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-27 11:23:48,397 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-27 11:23:48,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:48,398 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-27 11:23:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-27 11:23:48,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:48,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:48,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:23:48,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:23:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-04-27 11:23:48,400 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 41 [2022-04-27 11:23:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:23:48,400 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-04-27 11:23:48,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-04-27 11:23:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 11:23:48,401 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:23:48,401 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:23:48,421 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-27 11:23:48,612 WARN L477 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-27 11:23:48,612 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:23:48,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:23:48,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1498663498, now seen corresponding path program 3 times [2022-04-27 11:23:48,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:23:48,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306090375] [2022-04-27 11:23:48,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:23:48,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:23:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:48,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:23:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:48,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {2235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2215#true} is VALID [2022-04-27 11:23:48,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {2215#true} assume true; {2215#true} is VALID [2022-04-27 11:23:48,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2215#true} {2215#true} #42#return; {2215#true} is VALID [2022-04-27 11:23:48,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {2215#true} call ULTIMATE.init(); {2235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:23:48,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {2235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2215#true} is VALID [2022-04-27 11:23:48,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {2215#true} assume true; {2215#true} is VALID [2022-04-27 11:23:48,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2215#true} {2215#true} #42#return; {2215#true} is VALID [2022-04-27 11:23:48,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {2215#true} call #t~ret6 := main(); {2215#true} is VALID [2022-04-27 11:23:48,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {2215#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2220#(= main_~x~0 0)} is VALID [2022-04-27 11:23:48,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {2220#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2220#(= main_~x~0 0)} is VALID [2022-04-27 11:23:48,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {2220#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {2220#(= main_~x~0 0)} is VALID [2022-04-27 11:23:48,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {2220#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:48,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:48,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:48,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:48,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:48,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:48,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:23:48,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:23:48,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:23:48,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:23:48,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:23:48,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:23:48,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:23:48,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:23:48,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:23:48,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:23:48,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:23:48,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 >= 5000000); {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:23:48,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:23:48,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:23:48,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:23:48,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:23:48,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:23:48,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:23:48,907 INFO L290 TraceCheckUtils]: 32: Hoare triple {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:23:48,907 INFO L290 TraceCheckUtils]: 33: Hoare triple {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:23:48,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:23:48,908 INFO L290 TraceCheckUtils]: 35: Hoare triple {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:23:48,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:23:48,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:23:48,909 INFO L290 TraceCheckUtils]: 38: Hoare triple {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:23:48,909 INFO L290 TraceCheckUtils]: 39: Hoare triple {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:23:48,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:23:48,910 INFO L290 TraceCheckUtils]: 41: Hoare triple {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:23:48,910 INFO L290 TraceCheckUtils]: 42: Hoare triple {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:23:48,911 INFO L290 TraceCheckUtils]: 43: Hoare triple {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:23:48,911 INFO L290 TraceCheckUtils]: 44: Hoare triple {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2233#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:23:48,911 INFO L290 TraceCheckUtils]: 45: Hoare triple {2233#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2233#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:23:48,912 INFO L290 TraceCheckUtils]: 46: Hoare triple {2233#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2233#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:23:48,912 INFO L290 TraceCheckUtils]: 47: Hoare triple {2233#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2234#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:23:48,913 INFO L290 TraceCheckUtils]: 48: Hoare triple {2234#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2234#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:23:48,913 INFO L290 TraceCheckUtils]: 49: Hoare triple {2234#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2216#false} is VALID [2022-04-27 11:23:48,913 INFO L290 TraceCheckUtils]: 50: Hoare triple {2216#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2216#false} is VALID [2022-04-27 11:23:48,913 INFO L290 TraceCheckUtils]: 51: Hoare triple {2216#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2216#false} is VALID [2022-04-27 11:23:48,913 INFO L272 TraceCheckUtils]: 52: Hoare triple {2216#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {2216#false} is VALID [2022-04-27 11:23:48,913 INFO L290 TraceCheckUtils]: 53: Hoare triple {2216#false} ~cond := #in~cond; {2216#false} is VALID [2022-04-27 11:23:48,913 INFO L290 TraceCheckUtils]: 54: Hoare triple {2216#false} assume 0 == ~cond; {2216#false} is VALID [2022-04-27 11:23:48,913 INFO L290 TraceCheckUtils]: 55: Hoare triple {2216#false} assume !false; {2216#false} is VALID [2022-04-27 11:23:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:23:48,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:23:48,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306090375] [2022-04-27 11:23:48,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306090375] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:23:48,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378059211] [2022-04-27 11:23:48,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:23:48,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:23:48,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:23:48,915 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-27 11:23:48,916 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-27 11:23:48,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 11:23:48,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:23:48,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:23:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:48,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:23:49,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {2215#true} call ULTIMATE.init(); {2215#true} is VALID [2022-04-27 11:23:49,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {2215#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(17, 2);call #Ultimate.allocInit(12, 3); {2215#true} is VALID [2022-04-27 11:23:49,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {2215#true} assume true; {2215#true} is VALID [2022-04-27 11:23:49,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2215#true} {2215#true} #42#return; {2215#true} is VALID [2022-04-27 11:23:49,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {2215#true} call #t~ret6 := main(); {2215#true} is VALID [2022-04-27 11:23:49,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {2215#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {2254#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {2254#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {2254#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {2254#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {2254#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {2254#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {2254#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {2254#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {2254#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {2254#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {2254#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {2254#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {2254#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {2254#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {2254#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {2254#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {2254#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {2254#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {2254#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {2254#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {2254#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {2254#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {2254#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {2254#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {2254#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {2254#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {2254#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {2254#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {2254#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {2254#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {2254#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {2254#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,369 INFO L290 TraceCheckUtils]: 38: Hoare triple {2254#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,369 INFO L290 TraceCheckUtils]: 39: Hoare triple {2254#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {2254#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {2254#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,370 INFO L290 TraceCheckUtils]: 42: Hoare triple {2254#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {2254#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {2254#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {2254#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2254#(= main_~y~0 10000000)} is VALID [2022-04-27 11:23:49,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {2254#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {2378#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 11:23:49,372 INFO L290 TraceCheckUtils]: 47: Hoare triple {2378#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2382#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:23:49,373 INFO L290 TraceCheckUtils]: 48: Hoare triple {2382#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2382#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:23:49,373 INFO L290 TraceCheckUtils]: 49: Hoare triple {2382#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2382#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:23:49,373 INFO L290 TraceCheckUtils]: 50: Hoare triple {2382#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2392#(and (not (<= 5000000 (mod (+ main_~x~0 4294967294) 4294967296))) (= main_~y~0 10000000))} is VALID [2022-04-27 11:23:49,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {2392#(and (not (<= 5000000 (mod (+ main_~x~0 4294967294) 4294967296))) (= main_~y~0 10000000))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2216#false} is VALID [2022-04-27 11:23:49,375 INFO L272 TraceCheckUtils]: 52: Hoare triple {2216#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {2216#false} is VALID [2022-04-27 11:23:49,375 INFO L290 TraceCheckUtils]: 53: Hoare triple {2216#false} ~cond := #in~cond; {2216#false} is VALID [2022-04-27 11:23:49,375 INFO L290 TraceCheckUtils]: 54: Hoare triple {2216#false} assume 0 == ~cond; {2216#false} is VALID [2022-04-27 11:23:49,375 INFO L290 TraceCheckUtils]: 55: Hoare triple {2216#false} assume !false; {2216#false} is VALID [2022-04-27 11:23:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-04-27 11:23:49,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:23:49,811 INFO L290 TraceCheckUtils]: 55: Hoare triple {2216#false} assume !false; {2216#false} is VALID [2022-04-27 11:23:49,812 INFO L290 TraceCheckUtils]: 54: Hoare triple {2216#false} assume 0 == ~cond; {2216#false} is VALID [2022-04-27 11:23:49,812 INFO L290 TraceCheckUtils]: 53: Hoare triple {2216#false} ~cond := #in~cond; {2216#false} is VALID [2022-04-27 11:23:49,812 INFO L272 TraceCheckUtils]: 52: Hoare triple {2216#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {2216#false} is VALID [2022-04-27 11:23:49,812 INFO L290 TraceCheckUtils]: 51: Hoare triple {2420#(< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2216#false} is VALID [2022-04-27 11:23:49,813 INFO L290 TraceCheckUtils]: 50: Hoare triple {2424#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2420#(< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:49,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {2424#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2424#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:49,814 INFO L290 TraceCheckUtils]: 48: Hoare triple {2424#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2424#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:49,814 INFO L290 TraceCheckUtils]: 47: Hoare triple {2434#(< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2424#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:49,817 INFO L290 TraceCheckUtils]: 46: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !(~x~0 % 4294967296 >= 5000000); {2434#(< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:23:49,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,818 INFO L290 TraceCheckUtils]: 44: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,818 INFO L290 TraceCheckUtils]: 43: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !(~x~0 % 4294967296 >= 5000000); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,819 INFO L290 TraceCheckUtils]: 40: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !(~x~0 % 4294967296 >= 5000000); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,819 INFO L290 TraceCheckUtils]: 39: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,820 INFO L290 TraceCheckUtils]: 37: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !(~x~0 % 4294967296 >= 5000000); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,820 INFO L290 TraceCheckUtils]: 36: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !(~x~0 % 4294967296 >= 5000000); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !(~x~0 % 4294967296 >= 5000000); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !(~x~0 % 4294967296 >= 5000000); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !(~x~0 % 4294967296 >= 5000000); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !(~x~0 % 4294967296 >= 5000000); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !(~x~0 % 4294967296 >= 5000000); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !(~x~0 % 4294967296 >= 5000000); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !(~x~0 % 4294967296 >= 5000000); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !(~x~0 % 4294967296 >= 5000000); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !(~x~0 % 4294967296 >= 5000000); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {2215#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-27 11:23:49,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {2215#true} call #t~ret6 := main(); {2215#true} is VALID [2022-04-27 11:23:49,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2215#true} {2215#true} #42#return; {2215#true} is VALID [2022-04-27 11:23:49,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {2215#true} assume true; {2215#true} is VALID [2022-04-27 11:23:49,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {2215#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(17, 2);call #Ultimate.allocInit(12, 3); {2215#true} is VALID [2022-04-27 11:23:49,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {2215#true} call ULTIMATE.init(); {2215#true} is VALID [2022-04-27 11:23:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-04-27 11:23:49,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378059211] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:23:49,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:23:49,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 26 [2022-04-27 11:23:49,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048674652] [2022-04-27 11:23:49,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:23:49,830 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-27 11:23:49,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:23:49,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:49,888 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-27 11:23:49,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 11:23:49,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:23:49,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 11:23:49,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-04-27 11:23:49,890 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:52,059 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2022-04-27 11:23:52,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-27 11:23:52,059 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-27 11:23:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:23:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 100 transitions. [2022-04-27 11:23:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 100 transitions. [2022-04-27 11:23:52,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 100 transitions. [2022-04-27 11:23:52,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:23:52,245 INFO L225 Difference]: With dead ends: 89 [2022-04-27 11:23:52,245 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 11:23:52,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=547, Invalid=2003, Unknown=0, NotChecked=0, Total=2550 [2022-04-27 11:23:52,246 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 230 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:23:52,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 92 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 11:23:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 11:23:52,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2022-04-27 11:23:52,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:23:52,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:52,306 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:52,306 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:52,308 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-04-27 11:23:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-04-27 11:23:52,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:52,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:52,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-27 11:23:52,308 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-27 11:23:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:52,310 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-04-27 11:23:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-04-27 11:23:52,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:52,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:52,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:23:52,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:23:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-04-27 11:23:52,311 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 56 [2022-04-27 11:23:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:23:52,311 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-04-27 11:23:52,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-27 11:23:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-27 11:23:52,313 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:23:52,313 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 16, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:23:52,333 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-27 11:23:52,523 WARN L477 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-27 11:23:52,523 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:23:52,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:23:52,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1989301962, now seen corresponding path program 4 times [2022-04-27 11:23:52,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:23:52,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208745481] [2022-04-27 11:23:52,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:23:52,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:23:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:52,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:23:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:52,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {3034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3012#true} is VALID [2022-04-27 11:23:52,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {3012#true} assume true; {3012#true} is VALID [2022-04-27 11:23:52,881 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3012#true} {3012#true} #42#return; {3012#true} is VALID [2022-04-27 11:23:52,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {3012#true} call ULTIMATE.init(); {3034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:23:52,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {3034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3012#true} is VALID [2022-04-27 11:23:52,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {3012#true} assume true; {3012#true} is VALID [2022-04-27 11:23:52,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3012#true} {3012#true} #42#return; {3012#true} is VALID [2022-04-27 11:23:52,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {3012#true} call #t~ret6 := main(); {3012#true} is VALID [2022-04-27 11:23:52,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {3012#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3017#(= main_~x~0 0)} is VALID [2022-04-27 11:23:52,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {3017#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3017#(= main_~x~0 0)} is VALID [2022-04-27 11:23:52,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {3017#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {3017#(= main_~x~0 0)} is VALID [2022-04-27 11:23:52,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {3017#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:52,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:52,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:52,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:52,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:52,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:52,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:23:52,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:23:52,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:23:52,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:23:52,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:23:52,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:23:52,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:23:52,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:23:52,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:23:52,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:23:52,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:23:52,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 >= 5000000); {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:23:52,891 INFO L290 TraceCheckUtils]: 26: Hoare triple {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:23:52,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:23:52,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:23:52,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:23:52,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:23:52,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:23:52,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:23:52,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:23:52,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:23:52,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:23:52,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:23:52,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:23:52,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:23:52,897 INFO L290 TraceCheckUtils]: 39: Hoare triple {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:23:52,897 INFO L290 TraceCheckUtils]: 40: Hoare triple {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:23:52,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:23:52,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:23:52,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:23:52,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:23:52,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:23:52,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:23:52,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:23:52,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:23:52,901 INFO L290 TraceCheckUtils]: 49: Hoare triple {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 >= 5000000); {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:23:52,902 INFO L290 TraceCheckUtils]: 50: Hoare triple {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:23:52,902 INFO L290 TraceCheckUtils]: 51: Hoare triple {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:23:52,902 INFO L290 TraceCheckUtils]: 52: Hoare triple {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 >= 5000000); {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:23:52,903 INFO L290 TraceCheckUtils]: 53: Hoare triple {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3033#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:23:52,903 INFO L290 TraceCheckUtils]: 54: Hoare triple {3033#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3033#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:23:52,904 INFO L290 TraceCheckUtils]: 55: Hoare triple {3033#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3013#false} is VALID [2022-04-27 11:23:52,904 INFO L290 TraceCheckUtils]: 56: Hoare triple {3013#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3013#false} is VALID [2022-04-27 11:23:52,904 INFO L290 TraceCheckUtils]: 57: Hoare triple {3013#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3013#false} is VALID [2022-04-27 11:23:52,904 INFO L290 TraceCheckUtils]: 58: Hoare triple {3013#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3013#false} is VALID [2022-04-27 11:23:52,904 INFO L290 TraceCheckUtils]: 59: Hoare triple {3013#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3013#false} is VALID [2022-04-27 11:23:52,904 INFO L290 TraceCheckUtils]: 60: Hoare triple {3013#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3013#false} is VALID [2022-04-27 11:23:52,904 INFO L290 TraceCheckUtils]: 61: Hoare triple {3013#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3013#false} is VALID [2022-04-27 11:23:52,904 INFO L290 TraceCheckUtils]: 62: Hoare triple {3013#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3013#false} is VALID [2022-04-27 11:23:52,904 INFO L290 TraceCheckUtils]: 63: Hoare triple {3013#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3013#false} is VALID [2022-04-27 11:23:52,904 INFO L290 TraceCheckUtils]: 64: Hoare triple {3013#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3013#false} is VALID [2022-04-27 11:23:52,904 INFO L290 TraceCheckUtils]: 65: Hoare triple {3013#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3013#false} is VALID [2022-04-27 11:23:52,905 INFO L290 TraceCheckUtils]: 66: Hoare triple {3013#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3013#false} is VALID [2022-04-27 11:23:52,905 INFO L290 TraceCheckUtils]: 67: Hoare triple {3013#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3013#false} is VALID [2022-04-27 11:23:52,905 INFO L290 TraceCheckUtils]: 68: Hoare triple {3013#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3013#false} is VALID [2022-04-27 11:23:52,905 INFO L290 TraceCheckUtils]: 69: Hoare triple {3013#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {3013#false} is VALID [2022-04-27 11:23:52,905 INFO L272 TraceCheckUtils]: 70: Hoare triple {3013#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {3013#false} is VALID [2022-04-27 11:23:52,905 INFO L290 TraceCheckUtils]: 71: Hoare triple {3013#false} ~cond := #in~cond; {3013#false} is VALID [2022-04-27 11:23:52,905 INFO L290 TraceCheckUtils]: 72: Hoare triple {3013#false} assume 0 == ~cond; {3013#false} is VALID [2022-04-27 11:23:52,905 INFO L290 TraceCheckUtils]: 73: Hoare triple {3013#false} assume !false; {3013#false} is VALID [2022-04-27 11:23:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 233 proven. 392 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 11:23:52,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:23:52,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208745481] [2022-04-27 11:23:52,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208745481] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:23:52,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041705917] [2022-04-27 11:23:52,906 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:23:52,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:23:52,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:23:52,907 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-27 11:23:52,933 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-27 11:23:52,986 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:23:52,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:23:52,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-27 11:23:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:53,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:23:53,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {3012#true} call ULTIMATE.init(); {3012#true} is VALID [2022-04-27 11:23:53,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {3012#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(17, 2);call #Ultimate.allocInit(12, 3); {3012#true} is VALID [2022-04-27 11:23:53,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {3012#true} assume true; {3012#true} is VALID [2022-04-27 11:23:53,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3012#true} {3012#true} #42#return; {3012#true} is VALID [2022-04-27 11:23:53,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {3012#true} call #t~ret6 := main(); {3012#true} is VALID [2022-04-27 11:23:53,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {3012#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3017#(= main_~x~0 0)} is VALID [2022-04-27 11:23:53,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {3017#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3017#(= main_~x~0 0)} is VALID [2022-04-27 11:23:53,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {3017#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {3017#(= main_~x~0 0)} is VALID [2022-04-27 11:23:53,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {3017#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:53,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:53,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:23:53,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:53,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:53,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:23:53,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:23:53,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:23:53,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:23:53,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:23:53,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:23:53,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:23:53,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:23:53,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:23:53,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:23:53,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:23:53,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:23:53,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 >= 5000000); {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:23:53,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:23:53,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:23:53,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:23:53,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:23:53,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:23:53,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:23:53,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:23:53,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:23:53,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:23:53,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:23:53,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:23:53,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:23:53,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:23:53,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:23:53,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:23:53,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:23:53,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:23:53,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:23:53,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:23:53,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:23:53,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:23:53,775 INFO L290 TraceCheckUtils]: 47: Hoare triple {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:23:53,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:23:53,776 INFO L290 TraceCheckUtils]: 49: Hoare triple {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 >= 5000000); {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:23:53,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:23:53,776 INFO L290 TraceCheckUtils]: 51: Hoare triple {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:23:53,777 INFO L290 TraceCheckUtils]: 52: Hoare triple {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 >= 5000000); {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:23:53,777 INFO L290 TraceCheckUtils]: 53: Hoare triple {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:23:53,778 INFO L290 TraceCheckUtils]: 54: Hoare triple {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:23:53,778 INFO L290 TraceCheckUtils]: 55: Hoare triple {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:23:53,778 INFO L290 TraceCheckUtils]: 56: Hoare triple {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3207#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:23:53,779 INFO L290 TraceCheckUtils]: 57: Hoare triple {3207#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3207#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:23:53,779 INFO L290 TraceCheckUtils]: 58: Hoare triple {3207#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3207#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:23:53,780 INFO L290 TraceCheckUtils]: 59: Hoare triple {3207#(and (<= 17 main_~x~0) (<= main_~x~0 17))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3217#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:23:53,780 INFO L290 TraceCheckUtils]: 60: Hoare triple {3217#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3217#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:23:53,780 INFO L290 TraceCheckUtils]: 61: Hoare triple {3217#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3217#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:23:53,781 INFO L290 TraceCheckUtils]: 62: Hoare triple {3217#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3227#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:23:53,781 INFO L290 TraceCheckUtils]: 63: Hoare triple {3227#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3227#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:23:53,782 INFO L290 TraceCheckUtils]: 64: Hoare triple {3227#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3227#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:23:53,782 INFO L290 TraceCheckUtils]: 65: Hoare triple {3227#(and (<= 19 main_~x~0) (<= main_~x~0 19))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3237#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 11:23:53,782 INFO L290 TraceCheckUtils]: 66: Hoare triple {3237#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3237#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 11:23:53,783 INFO L290 TraceCheckUtils]: 67: Hoare triple {3237#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3013#false} is VALID [2022-04-27 11:23:53,783 INFO L290 TraceCheckUtils]: 68: Hoare triple {3013#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3013#false} is VALID [2022-04-27 11:23:53,783 INFO L290 TraceCheckUtils]: 69: Hoare triple {3013#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {3013#false} is VALID [2022-04-27 11:23:53,783 INFO L272 TraceCheckUtils]: 70: Hoare triple {3013#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {3013#false} is VALID [2022-04-27 11:23:53,783 INFO L290 TraceCheckUtils]: 71: Hoare triple {3013#false} ~cond := #in~cond; {3013#false} is VALID [2022-04-27 11:23:53,783 INFO L290 TraceCheckUtils]: 72: Hoare triple {3013#false} assume 0 == ~cond; {3013#false} is VALID [2022-04-27 11:23:53,783 INFO L290 TraceCheckUtils]: 73: Hoare triple {3013#false} assume !false; {3013#false} is VALID [2022-04-27 11:23:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:23:53,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:23:55,276 INFO L290 TraceCheckUtils]: 73: Hoare triple {3013#false} assume !false; {3013#false} is VALID [2022-04-27 11:23:55,276 INFO L290 TraceCheckUtils]: 72: Hoare triple {3013#false} assume 0 == ~cond; {3013#false} is VALID [2022-04-27 11:23:55,277 INFO L290 TraceCheckUtils]: 71: Hoare triple {3013#false} ~cond := #in~cond; {3013#false} is VALID [2022-04-27 11:23:55,277 INFO L272 TraceCheckUtils]: 70: Hoare triple {3013#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {3013#false} is VALID [2022-04-27 11:23:55,277 INFO L290 TraceCheckUtils]: 69: Hoare triple {3013#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {3013#false} is VALID [2022-04-27 11:23:55,277 INFO L290 TraceCheckUtils]: 68: Hoare triple {3013#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3013#false} is VALID [2022-04-27 11:23:55,277 INFO L290 TraceCheckUtils]: 67: Hoare triple {3280#(not (<= 5000000 (mod main_~x~0 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3013#false} is VALID [2022-04-27 11:23:55,277 INFO L290 TraceCheckUtils]: 66: Hoare triple {3284#(or (<= 4294967295 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3280#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:23:55,279 INFO L290 TraceCheckUtils]: 65: Hoare triple {3288#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3284#(or (<= 4294967295 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 11:23:55,279 INFO L290 TraceCheckUtils]: 64: Hoare triple {3288#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3288#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:23:55,280 INFO L290 TraceCheckUtils]: 63: Hoare triple {3288#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3288#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:23:55,280 INFO L290 TraceCheckUtils]: 62: Hoare triple {3298#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3288#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:23:55,281 INFO L290 TraceCheckUtils]: 61: Hoare triple {3298#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3298#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-27 11:23:55,281 INFO L290 TraceCheckUtils]: 60: Hoare triple {3298#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3298#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-27 11:23:55,281 INFO L290 TraceCheckUtils]: 59: Hoare triple {3308#(or (<= 4294967295 (mod (+ main_~x~0 3) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3298#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-27 11:23:55,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {3308#(or (<= 4294967295 (mod (+ main_~x~0 3) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3308#(or (<= 4294967295 (mod (+ main_~x~0 3) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} is VALID [2022-04-27 11:23:55,282 INFO L290 TraceCheckUtils]: 57: Hoare triple {3308#(or (<= 4294967295 (mod (+ main_~x~0 3) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3308#(or (<= 4294967295 (mod (+ main_~x~0 3) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} is VALID [2022-04-27 11:23:55,283 INFO L290 TraceCheckUtils]: 56: Hoare triple {3318#(or (<= 4294967295 (mod (+ main_~x~0 4) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3308#(or (<= 4294967295 (mod (+ main_~x~0 3) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} is VALID [2022-04-27 11:23:55,283 INFO L290 TraceCheckUtils]: 55: Hoare triple {3318#(or (<= 4294967295 (mod (+ main_~x~0 4) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3318#(or (<= 4294967295 (mod (+ main_~x~0 4) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} is VALID [2022-04-27 11:23:55,284 INFO L290 TraceCheckUtils]: 54: Hoare triple {3318#(or (<= 4294967295 (mod (+ main_~x~0 4) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3318#(or (<= 4294967295 (mod (+ main_~x~0 4) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} is VALID [2022-04-27 11:23:55,284 INFO L290 TraceCheckUtils]: 53: Hoare triple {3328#(or (<= 4294967295 (mod (+ 5 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3318#(or (<= 4294967295 (mod (+ main_~x~0 4) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} is VALID [2022-04-27 11:23:55,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {3328#(or (<= 4294967295 (mod (+ 5 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {3328#(or (<= 4294967295 (mod (+ 5 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:23:55,285 INFO L290 TraceCheckUtils]: 51: Hoare triple {3328#(or (<= 4294967295 (mod (+ 5 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3328#(or (<= 4294967295 (mod (+ 5 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:23:55,285 INFO L290 TraceCheckUtils]: 50: Hoare triple {3338#(or (<= 4294967295 (mod (+ main_~x~0 6) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3328#(or (<= 4294967295 (mod (+ 5 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:23:55,286 INFO L290 TraceCheckUtils]: 49: Hoare triple {3338#(or (<= 4294967295 (mod (+ main_~x~0 6) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {3338#(or (<= 4294967295 (mod (+ main_~x~0 6) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-27 11:23:55,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {3338#(or (<= 4294967295 (mod (+ main_~x~0 6) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3338#(or (<= 4294967295 (mod (+ main_~x~0 6) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-27 11:23:55,289 INFO L290 TraceCheckUtils]: 47: Hoare triple {3348#(or (<= 4294967295 (mod (+ 7 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3338#(or (<= 4294967295 (mod (+ main_~x~0 6) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-27 11:23:55,290 INFO L290 TraceCheckUtils]: 46: Hoare triple {3348#(or (<= 4294967295 (mod (+ 7 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {3348#(or (<= 4294967295 (mod (+ 7 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:23:55,290 INFO L290 TraceCheckUtils]: 45: Hoare triple {3348#(or (<= 4294967295 (mod (+ 7 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3348#(or (<= 4294967295 (mod (+ 7 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:23:55,291 INFO L290 TraceCheckUtils]: 44: Hoare triple {3358#(or (<= 4294967295 (mod (+ main_~x~0 8) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3348#(or (<= 4294967295 (mod (+ 7 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:23:55,291 INFO L290 TraceCheckUtils]: 43: Hoare triple {3358#(or (<= 4294967295 (mod (+ main_~x~0 8) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {3358#(or (<= 4294967295 (mod (+ main_~x~0 8) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} is VALID [2022-04-27 11:23:55,291 INFO L290 TraceCheckUtils]: 42: Hoare triple {3358#(or (<= 4294967295 (mod (+ main_~x~0 8) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3358#(or (<= 4294967295 (mod (+ main_~x~0 8) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} is VALID [2022-04-27 11:23:55,292 INFO L290 TraceCheckUtils]: 41: Hoare triple {3368#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 9) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3358#(or (<= 4294967295 (mod (+ main_~x~0 8) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} is VALID [2022-04-27 11:23:55,292 INFO L290 TraceCheckUtils]: 40: Hoare triple {3368#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 9) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {3368#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 11:23:55,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {3368#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 9) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3368#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 11:23:55,293 INFO L290 TraceCheckUtils]: 38: Hoare triple {3378#(or (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 10) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3368#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 11:23:55,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {3378#(or (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 10) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {3378#(or (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-27 11:23:55,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {3378#(or (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 10) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3378#(or (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-27 11:23:55,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {3388#(or (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 11) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3378#(or (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-27 11:23:55,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {3388#(or (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 11) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {3388#(or (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-27 11:23:55,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {3388#(or (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 11) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3388#(or (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-27 11:23:55,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {3398#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 12) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3388#(or (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-27 11:23:55,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {3398#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 12) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {3398#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 11:23:55,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {3398#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 12) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3398#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 11:23:55,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {3408#(or (<= 4294967295 (mod (+ main_~x~0 13) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3398#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 11:23:55,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {3408#(or (<= 4294967295 (mod (+ main_~x~0 13) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {3408#(or (<= 4294967295 (mod (+ main_~x~0 13) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))))} is VALID [2022-04-27 11:23:55,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {3408#(or (<= 4294967295 (mod (+ main_~x~0 13) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3408#(or (<= 4294967295 (mod (+ main_~x~0 13) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))))} is VALID [2022-04-27 11:23:55,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {3418#(or (<= 4294967295 (mod (+ main_~x~0 14) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3408#(or (<= 4294967295 (mod (+ main_~x~0 13) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))))} is VALID [2022-04-27 11:23:55,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {3418#(or (<= 4294967295 (mod (+ main_~x~0 14) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {3418#(or (<= 4294967295 (mod (+ main_~x~0 14) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} is VALID [2022-04-27 11:23:55,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {3418#(or (<= 4294967295 (mod (+ main_~x~0 14) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3418#(or (<= 4294967295 (mod (+ main_~x~0 14) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} is VALID [2022-04-27 11:23:55,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {3428#(or (<= 4294967295 (mod (+ main_~x~0 15) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3418#(or (<= 4294967295 (mod (+ main_~x~0 14) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} is VALID [2022-04-27 11:23:55,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {3428#(or (<= 4294967295 (mod (+ main_~x~0 15) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {3428#(or (<= 4294967295 (mod (+ main_~x~0 15) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} is VALID [2022-04-27 11:23:55,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {3428#(or (<= 4294967295 (mod (+ main_~x~0 15) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3428#(or (<= 4294967295 (mod (+ main_~x~0 15) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} is VALID [2022-04-27 11:23:55,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {3438#(or (<= 4294967295 (mod (+ main_~x~0 16) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3428#(or (<= 4294967295 (mod (+ main_~x~0 15) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} is VALID [2022-04-27 11:23:55,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {3438#(or (<= 4294967295 (mod (+ main_~x~0 16) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {3438#(or (<= 4294967295 (mod (+ main_~x~0 16) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} is VALID [2022-04-27 11:23:55,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {3438#(or (<= 4294967295 (mod (+ main_~x~0 16) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3438#(or (<= 4294967295 (mod (+ main_~x~0 16) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} is VALID [2022-04-27 11:23:55,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {3448#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 17) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3438#(or (<= 4294967295 (mod (+ main_~x~0 16) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} is VALID [2022-04-27 11:23:55,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {3448#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 17) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {3448#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 11:23:55,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {3448#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 17) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3448#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 11:23:55,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {3458#(or (<= 4294967295 (mod (+ main_~x~0 18) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3448#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 11:23:55,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {3458#(or (<= 4294967295 (mod (+ main_~x~0 18) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {3458#(or (<= 4294967295 (mod (+ main_~x~0 18) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} is VALID [2022-04-27 11:23:55,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {3458#(or (<= 4294967295 (mod (+ main_~x~0 18) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3458#(or (<= 4294967295 (mod (+ main_~x~0 18) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} is VALID [2022-04-27 11:23:55,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {3468#(or (<= 4294967295 (mod (+ 19 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3458#(or (<= 4294967295 (mod (+ main_~x~0 18) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} is VALID [2022-04-27 11:23:55,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {3468#(or (<= 4294967295 (mod (+ 19 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {3468#(or (<= 4294967295 (mod (+ 19 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:23:55,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {3468#(or (<= 4294967295 (mod (+ 19 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3468#(or (<= 4294967295 (mod (+ 19 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:23:55,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {3478#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 20) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3468#(or (<= 4294967295 (mod (+ 19 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:23:55,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {3478#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 20) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {3478#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-27 11:23:55,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {3478#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 20) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3478#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-27 11:23:55,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {3012#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3478#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-27 11:23:55,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {3012#true} call #t~ret6 := main(); {3012#true} is VALID [2022-04-27 11:23:55,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3012#true} {3012#true} #42#return; {3012#true} is VALID [2022-04-27 11:23:55,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {3012#true} assume true; {3012#true} is VALID [2022-04-27 11:23:55,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {3012#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(17, 2);call #Ultimate.allocInit(12, 3); {3012#true} is VALID [2022-04-27 11:23:55,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {3012#true} call ULTIMATE.init(); {3012#true} is VALID [2022-04-27 11:23:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:23:55,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041705917] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:23:55,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:23:55,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 24] total 47 [2022-04-27 11:23:55,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519325056] [2022-04-27 11:23:55,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:23:55,310 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-27 11:23:55,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:23:55,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:55,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:23:55,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-27 11:23:55,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:23:55,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-27 11:23:55,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1569, Unknown=0, NotChecked=0, Total=2162 [2022-04-27 11:23:55,426 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:25:13,239 INFO L93 Difference]: Finished difference Result 175 states and 211 transitions. [2022-04-27 11:25:13,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-27 11:25:13,239 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-27 11:25:13,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:25:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 176 transitions. [2022-04-27 11:25:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:13,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 176 transitions. [2022-04-27 11:25:13,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 176 transitions. [2022-04-27 11:25:13,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:25:13,487 INFO L225 Difference]: With dead ends: 175 [2022-04-27 11:25:13,488 INFO L226 Difference]: Without dead ends: 153 [2022-04-27 11:25:13,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 75.9s TimeCoverageRelationStatistics Valid=2121, Invalid=5710, Unknown=1, NotChecked=0, Total=7832 [2022-04-27 11:25:13,490 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 316 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:25:13,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 119 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 11:25:13,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-27 11:25:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-04-27 11:25:13,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:25:13,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 153 states, 148 states have (on average 1.0405405405405406) internal successors, (154), 148 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:13,594 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 153 states, 148 states have (on average 1.0405405405405406) internal successors, (154), 148 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:13,595 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 153 states, 148 states have (on average 1.0405405405405406) internal successors, (154), 148 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:25:13,603 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions. [2022-04-27 11:25:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 158 transitions. [2022-04-27 11:25:13,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:25:13,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:25:13,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 148 states have (on average 1.0405405405405406) internal successors, (154), 148 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-27 11:25:13,604 INFO L87 Difference]: Start difference. First operand has 153 states, 148 states have (on average 1.0405405405405406) internal successors, (154), 148 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-27 11:25:13,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:25:13,607 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions. [2022-04-27 11:25:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 158 transitions. [2022-04-27 11:25:13,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:25:13,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:25:13,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:25:13,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:25:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.0405405405405406) internal successors, (154), 148 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 158 transitions. [2022-04-27 11:25:13,610 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 158 transitions. Word has length 74 [2022-04-27 11:25:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:25:13,610 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 158 transitions. [2022-04-27 11:25:13,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 158 transitions. [2022-04-27 11:25:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-04-27 11:25:13,612 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:25:13,612 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 42, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:25:13,632 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-27 11:25:13,829 WARN L477 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-27 11:25:13,829 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:25:13,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:25:13,830 INFO L85 PathProgramCache]: Analyzing trace with hash -397481014, now seen corresponding path program 5 times [2022-04-27 11:25:13,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:25:13,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598881004] [2022-04-27 11:25:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:25:13,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:25:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:25:14,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:25:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:25:14,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {4387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4339#true} is VALID [2022-04-27 11:25:14,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {4339#true} assume true; {4339#true} is VALID [2022-04-27 11:25:14,984 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4339#true} {4339#true} #42#return; {4339#true} is VALID [2022-04-27 11:25:14,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {4339#true} call ULTIMATE.init(); {4387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:25:14,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {4387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4339#true} is VALID [2022-04-27 11:25:14,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {4339#true} assume true; {4339#true} is VALID [2022-04-27 11:25:14,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4339#true} {4339#true} #42#return; {4339#true} is VALID [2022-04-27 11:25:14,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {4339#true} call #t~ret6 := main(); {4339#true} is VALID [2022-04-27 11:25:14,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {4339#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {4344#(= main_~x~0 0)} is VALID [2022-04-27 11:25:14,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {4344#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4344#(= main_~x~0 0)} is VALID [2022-04-27 11:25:14,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {4344#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {4344#(= main_~x~0 0)} is VALID [2022-04-27 11:25:14,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {4344#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4345#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:25:14,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {4345#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4345#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:25:14,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {4345#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {4345#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:25:14,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {4345#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4346#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:25:14,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {4346#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4346#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:25:14,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {4346#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {4346#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:25:14,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {4346#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4347#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:25:14,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {4347#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4347#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:25:14,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {4347#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4347#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:25:14,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {4347#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4348#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:25:14,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {4348#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4348#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:25:14,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {4348#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4348#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:25:14,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {4348#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4349#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:25:14,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {4349#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4349#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:25:14,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {4349#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {4349#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:25:14,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {4349#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4350#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:25:14,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {4350#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4350#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:25:14,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {4350#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 >= 5000000); {4350#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:25:14,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {4350#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4351#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:25:14,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {4351#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4351#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:25:14,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {4351#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4351#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:25:14,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {4351#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:25:14,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {4352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:25:14,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {4352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:25:14,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {4352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4353#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:25:14,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {4353#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4353#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:25:14,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {4353#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4353#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:25:14,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {4353#(and (<= main_~x~0 9) (<= 9 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4354#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:25:14,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {4354#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4354#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:25:14,997 INFO L290 TraceCheckUtils]: 37: Hoare triple {4354#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4354#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:25:14,997 INFO L290 TraceCheckUtils]: 38: Hoare triple {4354#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4355#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:25:14,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {4355#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4355#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:25:14,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {4355#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4355#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:25:14,998 INFO L290 TraceCheckUtils]: 41: Hoare triple {4355#(and (<= main_~x~0 11) (<= 11 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4356#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:25:14,999 INFO L290 TraceCheckUtils]: 42: Hoare triple {4356#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4356#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:25:14,999 INFO L290 TraceCheckUtils]: 43: Hoare triple {4356#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4356#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:25:14,999 INFO L290 TraceCheckUtils]: 44: Hoare triple {4356#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4357#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:25:15,000 INFO L290 TraceCheckUtils]: 45: Hoare triple {4357#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4357#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:25:15,000 INFO L290 TraceCheckUtils]: 46: Hoare triple {4357#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4357#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:25:15,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {4357#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4358#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:25:15,001 INFO L290 TraceCheckUtils]: 48: Hoare triple {4358#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4358#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:25:15,001 INFO L290 TraceCheckUtils]: 49: Hoare triple {4358#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 >= 5000000); {4358#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:25:15,001 INFO L290 TraceCheckUtils]: 50: Hoare triple {4358#(and (<= 14 main_~x~0) (<= main_~x~0 14))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4359#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:25:15,002 INFO L290 TraceCheckUtils]: 51: Hoare triple {4359#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4359#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:25:15,002 INFO L290 TraceCheckUtils]: 52: Hoare triple {4359#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 >= 5000000); {4359#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:25:15,003 INFO L290 TraceCheckUtils]: 53: Hoare triple {4359#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4360#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:25:15,003 INFO L290 TraceCheckUtils]: 54: Hoare triple {4360#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4360#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:25:15,003 INFO L290 TraceCheckUtils]: 55: Hoare triple {4360#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4360#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:25:15,004 INFO L290 TraceCheckUtils]: 56: Hoare triple {4360#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4361#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:25:15,004 INFO L290 TraceCheckUtils]: 57: Hoare triple {4361#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4361#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:25:15,004 INFO L290 TraceCheckUtils]: 58: Hoare triple {4361#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !(~x~0 % 4294967296 >= 5000000); {4361#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:25:15,005 INFO L290 TraceCheckUtils]: 59: Hoare triple {4361#(and (<= 17 main_~x~0) (<= main_~x~0 17))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4362#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:25:15,005 INFO L290 TraceCheckUtils]: 60: Hoare triple {4362#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4362#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:25:15,006 INFO L290 TraceCheckUtils]: 61: Hoare triple {4362#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4362#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:25:15,006 INFO L290 TraceCheckUtils]: 62: Hoare triple {4362#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4363#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:25:15,006 INFO L290 TraceCheckUtils]: 63: Hoare triple {4363#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4363#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:25:15,007 INFO L290 TraceCheckUtils]: 64: Hoare triple {4363#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !(~x~0 % 4294967296 >= 5000000); {4363#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:25:15,007 INFO L290 TraceCheckUtils]: 65: Hoare triple {4363#(and (<= 19 main_~x~0) (<= main_~x~0 19))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4364#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 11:25:15,008 INFO L290 TraceCheckUtils]: 66: Hoare triple {4364#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4364#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 11:25:15,008 INFO L290 TraceCheckUtils]: 67: Hoare triple {4364#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4364#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 11:25:15,009 INFO L290 TraceCheckUtils]: 68: Hoare triple {4364#(and (<= main_~x~0 20) (<= 20 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4365#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 11:25:15,009 INFO L290 TraceCheckUtils]: 69: Hoare triple {4365#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4365#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 11:25:15,009 INFO L290 TraceCheckUtils]: 70: Hoare triple {4365#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !(~x~0 % 4294967296 >= 5000000); {4365#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 11:25:15,011 INFO L290 TraceCheckUtils]: 71: Hoare triple {4365#(and (<= 21 main_~x~0) (<= main_~x~0 21))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4366#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 11:25:15,011 INFO L290 TraceCheckUtils]: 72: Hoare triple {4366#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4366#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 11:25:15,012 INFO L290 TraceCheckUtils]: 73: Hoare triple {4366#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 >= 5000000); {4366#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 11:25:15,012 INFO L290 TraceCheckUtils]: 74: Hoare triple {4366#(and (<= 22 main_~x~0) (<= main_~x~0 22))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4367#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 11:25:15,013 INFO L290 TraceCheckUtils]: 75: Hoare triple {4367#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4367#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 11:25:15,013 INFO L290 TraceCheckUtils]: 76: Hoare triple {4367#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !(~x~0 % 4294967296 >= 5000000); {4367#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 11:25:15,013 INFO L290 TraceCheckUtils]: 77: Hoare triple {4367#(and (<= 23 main_~x~0) (<= main_~x~0 23))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4368#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 11:25:15,014 INFO L290 TraceCheckUtils]: 78: Hoare triple {4368#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4368#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 11:25:15,027 INFO L290 TraceCheckUtils]: 79: Hoare triple {4368#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4368#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 11:25:15,040 INFO L290 TraceCheckUtils]: 80: Hoare triple {4368#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4369#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 11:25:15,040 INFO L290 TraceCheckUtils]: 81: Hoare triple {4369#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4369#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 11:25:15,041 INFO L290 TraceCheckUtils]: 82: Hoare triple {4369#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4369#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 11:25:15,041 INFO L290 TraceCheckUtils]: 83: Hoare triple {4369#(and (<= main_~x~0 25) (<= 25 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 11:25:15,041 INFO L290 TraceCheckUtils]: 84: Hoare triple {4370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 11:25:15,042 INFO L290 TraceCheckUtils]: 85: Hoare triple {4370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 11:25:15,042 INFO L290 TraceCheckUtils]: 86: Hoare triple {4370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4371#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 11:25:15,042 INFO L290 TraceCheckUtils]: 87: Hoare triple {4371#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4371#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 11:25:15,043 INFO L290 TraceCheckUtils]: 88: Hoare triple {4371#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !(~x~0 % 4294967296 >= 5000000); {4371#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 11:25:15,043 INFO L290 TraceCheckUtils]: 89: Hoare triple {4371#(and (<= 27 main_~x~0) (<= main_~x~0 27))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4372#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 11:25:15,043 INFO L290 TraceCheckUtils]: 90: Hoare triple {4372#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4372#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 11:25:15,044 INFO L290 TraceCheckUtils]: 91: Hoare triple {4372#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 >= 5000000); {4372#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 11:25:15,044 INFO L290 TraceCheckUtils]: 92: Hoare triple {4372#(and (<= 28 main_~x~0) (<= main_~x~0 28))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4373#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 11:25:15,044 INFO L290 TraceCheckUtils]: 93: Hoare triple {4373#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4373#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 11:25:15,045 INFO L290 TraceCheckUtils]: 94: Hoare triple {4373#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4373#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 11:25:15,045 INFO L290 TraceCheckUtils]: 95: Hoare triple {4373#(and (<= main_~x~0 29) (<= 29 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4374#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 11:25:15,046 INFO L290 TraceCheckUtils]: 96: Hoare triple {4374#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4374#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 11:25:15,046 INFO L290 TraceCheckUtils]: 97: Hoare triple {4374#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(~x~0 % 4294967296 >= 5000000); {4374#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 11:25:15,046 INFO L290 TraceCheckUtils]: 98: Hoare triple {4374#(and (<= 30 main_~x~0) (<= main_~x~0 30))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4375#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 11:25:15,047 INFO L290 TraceCheckUtils]: 99: Hoare triple {4375#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4375#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 11:25:15,047 INFO L290 TraceCheckUtils]: 100: Hoare triple {4375#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !(~x~0 % 4294967296 >= 5000000); {4375#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 11:25:15,047 INFO L290 TraceCheckUtils]: 101: Hoare triple {4375#(and (<= 31 main_~x~0) (<= main_~x~0 31))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4376#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 11:25:15,048 INFO L290 TraceCheckUtils]: 102: Hoare triple {4376#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4376#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 11:25:15,048 INFO L290 TraceCheckUtils]: 103: Hoare triple {4376#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4376#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 11:25:15,048 INFO L290 TraceCheckUtils]: 104: Hoare triple {4376#(and (<= main_~x~0 32) (<= 32 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4377#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 11:25:15,049 INFO L290 TraceCheckUtils]: 105: Hoare triple {4377#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4377#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 11:25:15,049 INFO L290 TraceCheckUtils]: 106: Hoare triple {4377#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4377#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 11:25:15,049 INFO L290 TraceCheckUtils]: 107: Hoare triple {4377#(and (<= main_~x~0 33) (<= 33 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4378#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 11:25:15,050 INFO L290 TraceCheckUtils]: 108: Hoare triple {4378#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4378#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 11:25:15,050 INFO L290 TraceCheckUtils]: 109: Hoare triple {4378#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4378#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 11:25:15,050 INFO L290 TraceCheckUtils]: 110: Hoare triple {4378#(and (<= main_~x~0 34) (<= 34 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4379#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 11:25:15,051 INFO L290 TraceCheckUtils]: 111: Hoare triple {4379#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4379#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 11:25:15,051 INFO L290 TraceCheckUtils]: 112: Hoare triple {4379#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !(~x~0 % 4294967296 >= 5000000); {4379#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 11:25:15,051 INFO L290 TraceCheckUtils]: 113: Hoare triple {4379#(and (<= 35 main_~x~0) (<= main_~x~0 35))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 11:25:15,052 INFO L290 TraceCheckUtils]: 114: Hoare triple {4380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 11:25:15,052 INFO L290 TraceCheckUtils]: 115: Hoare triple {4380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 11:25:15,052 INFO L290 TraceCheckUtils]: 116: Hoare triple {4380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4381#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 11:25:15,053 INFO L290 TraceCheckUtils]: 117: Hoare triple {4381#(and (<= main_~x~0 37) (<= 37 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4381#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 11:25:15,053 INFO L290 TraceCheckUtils]: 118: Hoare triple {4381#(and (<= main_~x~0 37) (<= 37 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4381#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 11:25:15,053 INFO L290 TraceCheckUtils]: 119: Hoare triple {4381#(and (<= main_~x~0 37) (<= 37 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4382#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 11:25:15,054 INFO L290 TraceCheckUtils]: 120: Hoare triple {4382#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4382#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 11:25:15,054 INFO L290 TraceCheckUtils]: 121: Hoare triple {4382#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4382#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 11:25:15,054 INFO L290 TraceCheckUtils]: 122: Hoare triple {4382#(and (<= main_~x~0 38) (<= 38 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4383#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-27 11:25:15,055 INFO L290 TraceCheckUtils]: 123: Hoare triple {4383#(and (<= main_~x~0 39) (<= 39 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4383#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-27 11:25:15,055 INFO L290 TraceCheckUtils]: 124: Hoare triple {4383#(and (<= main_~x~0 39) (<= 39 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4383#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-27 11:25:15,055 INFO L290 TraceCheckUtils]: 125: Hoare triple {4383#(and (<= main_~x~0 39) (<= 39 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4384#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 11:25:15,056 INFO L290 TraceCheckUtils]: 126: Hoare triple {4384#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4384#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 11:25:15,056 INFO L290 TraceCheckUtils]: 127: Hoare triple {4384#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4384#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 11:25:15,056 INFO L290 TraceCheckUtils]: 128: Hoare triple {4384#(and (<= main_~x~0 40) (<= 40 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4385#(and (<= main_~x~0 41) (<= 41 main_~x~0))} is VALID [2022-04-27 11:25:15,057 INFO L290 TraceCheckUtils]: 129: Hoare triple {4385#(and (<= main_~x~0 41) (<= 41 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4385#(and (<= main_~x~0 41) (<= 41 main_~x~0))} is VALID [2022-04-27 11:25:15,066 INFO L290 TraceCheckUtils]: 130: Hoare triple {4385#(and (<= main_~x~0 41) (<= 41 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4385#(and (<= main_~x~0 41) (<= 41 main_~x~0))} is VALID [2022-04-27 11:25:15,067 INFO L290 TraceCheckUtils]: 131: Hoare triple {4385#(and (<= main_~x~0 41) (<= 41 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4386#(and (<= main_~x~0 42) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:25:15,067 INFO L290 TraceCheckUtils]: 132: Hoare triple {4386#(and (<= main_~x~0 42) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4386#(and (<= main_~x~0 42) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:25:15,068 INFO L290 TraceCheckUtils]: 133: Hoare triple {4386#(and (<= main_~x~0 42) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4340#false} is VALID [2022-04-27 11:25:15,068 INFO L290 TraceCheckUtils]: 134: Hoare triple {4340#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4340#false} is VALID [2022-04-27 11:25:15,068 INFO L290 TraceCheckUtils]: 135: Hoare triple {4340#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4340#false} is VALID [2022-04-27 11:25:15,068 INFO L290 TraceCheckUtils]: 136: Hoare triple {4340#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4340#false} is VALID [2022-04-27 11:25:15,068 INFO L290 TraceCheckUtils]: 137: Hoare triple {4340#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4340#false} is VALID [2022-04-27 11:25:15,068 INFO L290 TraceCheckUtils]: 138: Hoare triple {4340#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4340#false} is VALID [2022-04-27 11:25:15,068 INFO L290 TraceCheckUtils]: 139: Hoare triple {4340#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4340#false} is VALID [2022-04-27 11:25:15,068 INFO L290 TraceCheckUtils]: 140: Hoare triple {4340#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4340#false} is VALID [2022-04-27 11:25:15,068 INFO L290 TraceCheckUtils]: 141: Hoare triple {4340#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4340#false} is VALID [2022-04-27 11:25:15,068 INFO L290 TraceCheckUtils]: 142: Hoare triple {4340#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4340#false} is VALID [2022-04-27 11:25:15,068 INFO L290 TraceCheckUtils]: 143: Hoare triple {4340#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4340#false} is VALID [2022-04-27 11:25:15,068 INFO L290 TraceCheckUtils]: 144: Hoare triple {4340#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4340#false} is VALID [2022-04-27 11:25:15,068 INFO L290 TraceCheckUtils]: 145: Hoare triple {4340#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4340#false} is VALID [2022-04-27 11:25:15,069 INFO L290 TraceCheckUtils]: 146: Hoare triple {4340#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4340#false} is VALID [2022-04-27 11:25:15,069 INFO L290 TraceCheckUtils]: 147: Hoare triple {4340#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {4340#false} is VALID [2022-04-27 11:25:15,069 INFO L272 TraceCheckUtils]: 148: Hoare triple {4340#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {4340#false} is VALID [2022-04-27 11:25:15,069 INFO L290 TraceCheckUtils]: 149: Hoare triple {4340#false} ~cond := #in~cond; {4340#false} is VALID [2022-04-27 11:25:15,069 INFO L290 TraceCheckUtils]: 150: Hoare triple {4340#false} assume 0 == ~cond; {4340#false} is VALID [2022-04-27 11:25:15,069 INFO L290 TraceCheckUtils]: 151: Hoare triple {4340#false} assume !false; {4340#false} is VALID [2022-04-27 11:25:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 597 proven. 2667 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 11:25:15,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:25:15,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598881004] [2022-04-27 11:25:15,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598881004] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:25:15,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236216917] [2022-04-27 11:25:15,072 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:25:15,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:25:15,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:25:15,073 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:25:15,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 11:29:17,803 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2022-04-27 11:29:17,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:29:17,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 98 conjunts are in the unsatisfiable core [2022-04-27 11:29:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:17,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:29:20,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {4339#true} call ULTIMATE.init(); {4339#true} is VALID [2022-04-27 11:29:20,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {4339#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(17, 2);call #Ultimate.allocInit(12, 3); {4339#true} is VALID [2022-04-27 11:29:20,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {4339#true} assume true; {4339#true} is VALID [2022-04-27 11:29:20,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4339#true} {4339#true} #42#return; {4339#true} is VALID [2022-04-27 11:29:20,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {4339#true} call #t~ret6 := main(); {4339#true} is VALID [2022-04-27 11:29:20,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {4339#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {4406#(and (= main_~x~0 0) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {4406#(and (= main_~x~0 0) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4406#(and (= main_~x~0 0) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {4406#(and (= main_~x~0 0) (= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {4406#(and (= main_~x~0 0) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {4406#(and (= main_~x~0 0) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4416#(and (= main_~y~0 10000000) (= main_~x~0 1))} is VALID [2022-04-27 11:29:20,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {4416#(and (= main_~y~0 10000000) (= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4416#(and (= main_~y~0 10000000) (= main_~x~0 1))} is VALID [2022-04-27 11:29:20,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {4416#(and (= main_~y~0 10000000) (= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {4416#(and (= main_~y~0 10000000) (= main_~x~0 1))} is VALID [2022-04-27 11:29:20,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {4416#(and (= main_~y~0 10000000) (= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4426#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {4426#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4426#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {4426#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {4426#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {4426#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4436#(and (= main_~y~0 10000000) (= (+ (- 2) main_~x~0) 1))} is VALID [2022-04-27 11:29:20,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {4436#(and (= main_~y~0 10000000) (= (+ (- 2) main_~x~0) 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4436#(and (= main_~y~0 10000000) (= (+ (- 2) main_~x~0) 1))} is VALID [2022-04-27 11:29:20,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {4436#(and (= main_~y~0 10000000) (= (+ (- 2) main_~x~0) 1))} assume !(~x~0 % 4294967296 >= 5000000); {4436#(and (= main_~y~0 10000000) (= (+ (- 2) main_~x~0) 1))} is VALID [2022-04-27 11:29:20,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {4436#(and (= main_~y~0 10000000) (= (+ (- 2) main_~x~0) 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4446#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 1))} is VALID [2022-04-27 11:29:20,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {4446#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4446#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 1))} is VALID [2022-04-27 11:29:20,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {4446#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 1))} assume !(~x~0 % 4294967296 >= 5000000); {4446#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 1))} is VALID [2022-04-27 11:29:20,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {4446#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4456#(and (= main_~y~0 10000000) (= 5 main_~x~0))} is VALID [2022-04-27 11:29:20,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {4456#(and (= main_~y~0 10000000) (= 5 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4456#(and (= main_~y~0 10000000) (= 5 main_~x~0))} is VALID [2022-04-27 11:29:20,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {4456#(and (= main_~y~0 10000000) (= 5 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4456#(and (= main_~y~0 10000000) (= 5 main_~x~0))} is VALID [2022-04-27 11:29:20,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {4456#(and (= main_~y~0 10000000) (= 5 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4466#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 5))} is VALID [2022-04-27 11:29:20,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {4466#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4466#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 5))} is VALID [2022-04-27 11:29:20,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {4466#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 5))} assume !(~x~0 % 4294967296 >= 5000000); {4466#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 5))} is VALID [2022-04-27 11:29:20,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {4466#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4476#(and (= main_~y~0 10000000) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:29:20,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {4476#(and (= main_~y~0 10000000) (= 5 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4476#(and (= main_~y~0 10000000) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:29:20,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {4476#(and (= main_~y~0 10000000) (= 5 (+ (- 2) main_~x~0)))} assume !(~x~0 % 4294967296 >= 5000000); {4476#(and (= main_~y~0 10000000) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:29:20,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {4476#(and (= main_~y~0 10000000) (= 5 (+ (- 2) main_~x~0)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4486#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 5))} is VALID [2022-04-27 11:29:20,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {4486#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4486#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 5))} is VALID [2022-04-27 11:29:20,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {4486#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 5))} assume !(~x~0 % 4294967296 >= 5000000); {4486#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 5))} is VALID [2022-04-27 11:29:20,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {4486#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4496#(and (= main_~y~0 10000000) (= main_~x~0 9))} is VALID [2022-04-27 11:29:20,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {4496#(and (= main_~y~0 10000000) (= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4496#(and (= main_~y~0 10000000) (= main_~x~0 9))} is VALID [2022-04-27 11:29:20,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {4496#(and (= main_~y~0 10000000) (= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {4496#(and (= main_~y~0 10000000) (= main_~x~0 9))} is VALID [2022-04-27 11:29:20,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {4496#(and (= main_~y~0 10000000) (= main_~x~0 9))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4506#(and (= (+ (- 1) main_~x~0) 9) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {4506#(and (= (+ (- 1) main_~x~0) 9) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4506#(and (= (+ (- 1) main_~x~0) 9) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {4506#(and (= (+ (- 1) main_~x~0) 9) (= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {4506#(and (= (+ (- 1) main_~x~0) 9) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {4506#(and (= (+ (- 1) main_~x~0) 9) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4516#(and (= main_~y~0 10000000) (= main_~x~0 11))} is VALID [2022-04-27 11:29:20,518 INFO L290 TraceCheckUtils]: 39: Hoare triple {4516#(and (= main_~y~0 10000000) (= main_~x~0 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4516#(and (= main_~y~0 10000000) (= main_~x~0 11))} is VALID [2022-04-27 11:29:20,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {4516#(and (= main_~y~0 10000000) (= main_~x~0 11))} assume !(~x~0 % 4294967296 >= 5000000); {4516#(and (= main_~y~0 10000000) (= main_~x~0 11))} is VALID [2022-04-27 11:29:20,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {4516#(and (= main_~y~0 10000000) (= main_~x~0 11))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4526#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 11))} is VALID [2022-04-27 11:29:20,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {4526#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4526#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 11))} is VALID [2022-04-27 11:29:20,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {4526#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 11))} assume !(~x~0 % 4294967296 >= 5000000); {4526#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 11))} is VALID [2022-04-27 11:29:20,519 INFO L290 TraceCheckUtils]: 44: Hoare triple {4526#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 11))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4536#(and (= 11 (+ (- 2) main_~x~0)) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,520 INFO L290 TraceCheckUtils]: 45: Hoare triple {4536#(and (= 11 (+ (- 2) main_~x~0)) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4536#(and (= 11 (+ (- 2) main_~x~0)) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {4536#(and (= 11 (+ (- 2) main_~x~0)) (= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {4536#(and (= 11 (+ (- 2) main_~x~0)) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,520 INFO L290 TraceCheckUtils]: 47: Hoare triple {4536#(and (= 11 (+ (- 2) main_~x~0)) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4546#(and (= (+ main_~x~0 (- 3)) 11) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {4546#(and (= (+ main_~x~0 (- 3)) 11) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4546#(and (= (+ main_~x~0 (- 3)) 11) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {4546#(and (= (+ main_~x~0 (- 3)) 11) (= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {4546#(and (= (+ main_~x~0 (- 3)) 11) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,522 INFO L290 TraceCheckUtils]: 50: Hoare triple {4546#(and (= (+ main_~x~0 (- 3)) 11) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4556#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 4)) 11))} is VALID [2022-04-27 11:29:20,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {4556#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 4)) 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4556#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 4)) 11))} is VALID [2022-04-27 11:29:20,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {4556#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 4)) 11))} assume !(~x~0 % 4294967296 >= 5000000); {4556#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 4)) 11))} is VALID [2022-04-27 11:29:20,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {4556#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 4)) 11))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4566#(and (= main_~y~0 10000000) (= main_~x~0 16))} is VALID [2022-04-27 11:29:20,523 INFO L290 TraceCheckUtils]: 54: Hoare triple {4566#(and (= main_~y~0 10000000) (= main_~x~0 16))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4566#(and (= main_~y~0 10000000) (= main_~x~0 16))} is VALID [2022-04-27 11:29:20,523 INFO L290 TraceCheckUtils]: 55: Hoare triple {4566#(and (= main_~y~0 10000000) (= main_~x~0 16))} assume !(~x~0 % 4294967296 >= 5000000); {4566#(and (= main_~y~0 10000000) (= main_~x~0 16))} is VALID [2022-04-27 11:29:20,524 INFO L290 TraceCheckUtils]: 56: Hoare triple {4566#(and (= main_~y~0 10000000) (= main_~x~0 16))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4576#(and (= main_~y~0 10000000) (= main_~x~0 17))} is VALID [2022-04-27 11:29:20,524 INFO L290 TraceCheckUtils]: 57: Hoare triple {4576#(and (= main_~y~0 10000000) (= main_~x~0 17))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4576#(and (= main_~y~0 10000000) (= main_~x~0 17))} is VALID [2022-04-27 11:29:20,524 INFO L290 TraceCheckUtils]: 58: Hoare triple {4576#(and (= main_~y~0 10000000) (= main_~x~0 17))} assume !(~x~0 % 4294967296 >= 5000000); {4576#(and (= main_~y~0 10000000) (= main_~x~0 17))} is VALID [2022-04-27 11:29:20,525 INFO L290 TraceCheckUtils]: 59: Hoare triple {4576#(and (= main_~y~0 10000000) (= main_~x~0 17))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4586#(and (= (+ (- 1) main_~x~0) 17) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,525 INFO L290 TraceCheckUtils]: 60: Hoare triple {4586#(and (= (+ (- 1) main_~x~0) 17) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4586#(and (= (+ (- 1) main_~x~0) 17) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,525 INFO L290 TraceCheckUtils]: 61: Hoare triple {4586#(and (= (+ (- 1) main_~x~0) 17) (= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {4586#(and (= (+ (- 1) main_~x~0) 17) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,526 INFO L290 TraceCheckUtils]: 62: Hoare triple {4586#(and (= (+ (- 1) main_~x~0) 17) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4596#(and (= main_~y~0 10000000) (= 19 main_~x~0))} is VALID [2022-04-27 11:29:20,526 INFO L290 TraceCheckUtils]: 63: Hoare triple {4596#(and (= main_~y~0 10000000) (= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4596#(and (= main_~y~0 10000000) (= 19 main_~x~0))} is VALID [2022-04-27 11:29:20,526 INFO L290 TraceCheckUtils]: 64: Hoare triple {4596#(and (= main_~y~0 10000000) (= 19 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4596#(and (= main_~y~0 10000000) (= 19 main_~x~0))} is VALID [2022-04-27 11:29:20,527 INFO L290 TraceCheckUtils]: 65: Hoare triple {4596#(and (= main_~y~0 10000000) (= 19 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4606#(and (= main_~y~0 10000000) (= main_~x~0 20))} is VALID [2022-04-27 11:29:20,527 INFO L290 TraceCheckUtils]: 66: Hoare triple {4606#(and (= main_~y~0 10000000) (= main_~x~0 20))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4606#(and (= main_~y~0 10000000) (= main_~x~0 20))} is VALID [2022-04-27 11:29:20,528 INFO L290 TraceCheckUtils]: 67: Hoare triple {4606#(and (= main_~y~0 10000000) (= main_~x~0 20))} assume !(~x~0 % 4294967296 >= 5000000); {4606#(and (= main_~y~0 10000000) (= main_~x~0 20))} is VALID [2022-04-27 11:29:20,528 INFO L290 TraceCheckUtils]: 68: Hoare triple {4606#(and (= main_~y~0 10000000) (= main_~x~0 20))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4616#(and (= main_~y~0 10000000) (= main_~x~0 21))} is VALID [2022-04-27 11:29:20,528 INFO L290 TraceCheckUtils]: 69: Hoare triple {4616#(and (= main_~y~0 10000000) (= main_~x~0 21))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4616#(and (= main_~y~0 10000000) (= main_~x~0 21))} is VALID [2022-04-27 11:29:20,529 INFO L290 TraceCheckUtils]: 70: Hoare triple {4616#(and (= main_~y~0 10000000) (= main_~x~0 21))} assume !(~x~0 % 4294967296 >= 5000000); {4616#(and (= main_~y~0 10000000) (= main_~x~0 21))} is VALID [2022-04-27 11:29:20,529 INFO L290 TraceCheckUtils]: 71: Hoare triple {4616#(and (= main_~y~0 10000000) (= main_~x~0 21))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4626#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 21))} is VALID [2022-04-27 11:29:20,529 INFO L290 TraceCheckUtils]: 72: Hoare triple {4626#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 21))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4626#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 21))} is VALID [2022-04-27 11:29:20,530 INFO L290 TraceCheckUtils]: 73: Hoare triple {4626#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 21))} assume !(~x~0 % 4294967296 >= 5000000); {4626#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 21))} is VALID [2022-04-27 11:29:20,530 INFO L290 TraceCheckUtils]: 74: Hoare triple {4626#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 21))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4636#(and (= main_~y~0 10000000) (= 21 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:29:20,530 INFO L290 TraceCheckUtils]: 75: Hoare triple {4636#(and (= main_~y~0 10000000) (= 21 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4636#(and (= main_~y~0 10000000) (= 21 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:29:20,531 INFO L290 TraceCheckUtils]: 76: Hoare triple {4636#(and (= main_~y~0 10000000) (= 21 (+ (- 2) main_~x~0)))} assume !(~x~0 % 4294967296 >= 5000000); {4636#(and (= main_~y~0 10000000) (= 21 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:29:20,531 INFO L290 TraceCheckUtils]: 77: Hoare triple {4636#(and (= main_~y~0 10000000) (= 21 (+ (- 2) main_~x~0)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4646#(and (= main_~x~0 24) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,531 INFO L290 TraceCheckUtils]: 78: Hoare triple {4646#(and (= main_~x~0 24) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4646#(and (= main_~x~0 24) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,532 INFO L290 TraceCheckUtils]: 79: Hoare triple {4646#(and (= main_~x~0 24) (= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {4646#(and (= main_~x~0 24) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,532 INFO L290 TraceCheckUtils]: 80: Hoare triple {4646#(and (= main_~x~0 24) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4656#(and (= (+ (- 1) main_~x~0) 24) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,532 INFO L290 TraceCheckUtils]: 81: Hoare triple {4656#(and (= (+ (- 1) main_~x~0) 24) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4656#(and (= (+ (- 1) main_~x~0) 24) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,533 INFO L290 TraceCheckUtils]: 82: Hoare triple {4656#(and (= (+ (- 1) main_~x~0) 24) (= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {4656#(and (= (+ (- 1) main_~x~0) 24) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,533 INFO L290 TraceCheckUtils]: 83: Hoare triple {4656#(and (= (+ (- 1) main_~x~0) 24) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4666#(and (= main_~y~0 10000000) (= main_~x~0 26))} is VALID [2022-04-27 11:29:20,533 INFO L290 TraceCheckUtils]: 84: Hoare triple {4666#(and (= main_~y~0 10000000) (= main_~x~0 26))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4666#(and (= main_~y~0 10000000) (= main_~x~0 26))} is VALID [2022-04-27 11:29:20,534 INFO L290 TraceCheckUtils]: 85: Hoare triple {4666#(and (= main_~y~0 10000000) (= main_~x~0 26))} assume !(~x~0 % 4294967296 >= 5000000); {4666#(and (= main_~y~0 10000000) (= main_~x~0 26))} is VALID [2022-04-27 11:29:20,534 INFO L290 TraceCheckUtils]: 86: Hoare triple {4666#(and (= main_~y~0 10000000) (= main_~x~0 26))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4676#(and (= main_~y~0 10000000) (= main_~x~0 27))} is VALID [2022-04-27 11:29:20,534 INFO L290 TraceCheckUtils]: 87: Hoare triple {4676#(and (= main_~y~0 10000000) (= main_~x~0 27))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4676#(and (= main_~y~0 10000000) (= main_~x~0 27))} is VALID [2022-04-27 11:29:20,535 INFO L290 TraceCheckUtils]: 88: Hoare triple {4676#(and (= main_~y~0 10000000) (= main_~x~0 27))} assume !(~x~0 % 4294967296 >= 5000000); {4676#(and (= main_~y~0 10000000) (= main_~x~0 27))} is VALID [2022-04-27 11:29:20,535 INFO L290 TraceCheckUtils]: 89: Hoare triple {4676#(and (= main_~y~0 10000000) (= main_~x~0 27))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4686#(and (= (+ (- 1) main_~x~0) 27) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,535 INFO L290 TraceCheckUtils]: 90: Hoare triple {4686#(and (= (+ (- 1) main_~x~0) 27) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4686#(and (= (+ (- 1) main_~x~0) 27) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,536 INFO L290 TraceCheckUtils]: 91: Hoare triple {4686#(and (= (+ (- 1) main_~x~0) 27) (= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {4686#(and (= (+ (- 1) main_~x~0) 27) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,536 INFO L290 TraceCheckUtils]: 92: Hoare triple {4686#(and (= (+ (- 1) main_~x~0) 27) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4696#(and (= 29 main_~x~0) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,536 INFO L290 TraceCheckUtils]: 93: Hoare triple {4696#(and (= 29 main_~x~0) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4696#(and (= 29 main_~x~0) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,537 INFO L290 TraceCheckUtils]: 94: Hoare triple {4696#(and (= 29 main_~x~0) (= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {4696#(and (= 29 main_~x~0) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,537 INFO L290 TraceCheckUtils]: 95: Hoare triple {4696#(and (= 29 main_~x~0) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4706#(and (= main_~y~0 10000000) (= 30 main_~x~0))} is VALID [2022-04-27 11:29:20,537 INFO L290 TraceCheckUtils]: 96: Hoare triple {4706#(and (= main_~y~0 10000000) (= 30 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4706#(and (= main_~y~0 10000000) (= 30 main_~x~0))} is VALID [2022-04-27 11:29:20,538 INFO L290 TraceCheckUtils]: 97: Hoare triple {4706#(and (= main_~y~0 10000000) (= 30 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4706#(and (= main_~y~0 10000000) (= 30 main_~x~0))} is VALID [2022-04-27 11:29:20,538 INFO L290 TraceCheckUtils]: 98: Hoare triple {4706#(and (= main_~y~0 10000000) (= 30 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4716#(and (= (+ (- 1) main_~x~0) 30) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,538 INFO L290 TraceCheckUtils]: 99: Hoare triple {4716#(and (= (+ (- 1) main_~x~0) 30) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4716#(and (= (+ (- 1) main_~x~0) 30) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,539 INFO L290 TraceCheckUtils]: 100: Hoare triple {4716#(and (= (+ (- 1) main_~x~0) 30) (= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {4716#(and (= (+ (- 1) main_~x~0) 30) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,539 INFO L290 TraceCheckUtils]: 101: Hoare triple {4716#(and (= (+ (- 1) main_~x~0) 30) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4726#(and (= main_~y~0 10000000) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:29:20,539 INFO L290 TraceCheckUtils]: 102: Hoare triple {4726#(and (= main_~y~0 10000000) (= 30 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4726#(and (= main_~y~0 10000000) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:29:20,540 INFO L290 TraceCheckUtils]: 103: Hoare triple {4726#(and (= main_~y~0 10000000) (= 30 (+ (- 2) main_~x~0)))} assume !(~x~0 % 4294967296 >= 5000000); {4726#(and (= main_~y~0 10000000) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:29:20,540 INFO L290 TraceCheckUtils]: 104: Hoare triple {4726#(and (= main_~y~0 10000000) (= 30 (+ (- 2) main_~x~0)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4736#(and (= main_~x~0 33) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,540 INFO L290 TraceCheckUtils]: 105: Hoare triple {4736#(and (= main_~x~0 33) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4736#(and (= main_~x~0 33) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,541 INFO L290 TraceCheckUtils]: 106: Hoare triple {4736#(and (= main_~x~0 33) (= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {4736#(and (= main_~x~0 33) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,541 INFO L290 TraceCheckUtils]: 107: Hoare triple {4736#(and (= main_~x~0 33) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4746#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 33))} is VALID [2022-04-27 11:29:20,541 INFO L290 TraceCheckUtils]: 108: Hoare triple {4746#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 33))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4746#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 33))} is VALID [2022-04-27 11:29:20,541 INFO L290 TraceCheckUtils]: 109: Hoare triple {4746#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 33))} assume !(~x~0 % 4294967296 >= 5000000); {4746#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 33))} is VALID [2022-04-27 11:29:20,542 INFO L290 TraceCheckUtils]: 110: Hoare triple {4746#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 33))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4756#(and (= 35 main_~x~0) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,542 INFO L290 TraceCheckUtils]: 111: Hoare triple {4756#(and (= 35 main_~x~0) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4756#(and (= 35 main_~x~0) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,543 INFO L290 TraceCheckUtils]: 112: Hoare triple {4756#(and (= 35 main_~x~0) (= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {4756#(and (= 35 main_~x~0) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,543 INFO L290 TraceCheckUtils]: 113: Hoare triple {4756#(and (= 35 main_~x~0) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4766#(and (= main_~y~0 10000000) (= main_~x~0 36))} is VALID [2022-04-27 11:29:20,543 INFO L290 TraceCheckUtils]: 114: Hoare triple {4766#(and (= main_~y~0 10000000) (= main_~x~0 36))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4766#(and (= main_~y~0 10000000) (= main_~x~0 36))} is VALID [2022-04-27 11:29:20,543 INFO L290 TraceCheckUtils]: 115: Hoare triple {4766#(and (= main_~y~0 10000000) (= main_~x~0 36))} assume !(~x~0 % 4294967296 >= 5000000); {4766#(and (= main_~y~0 10000000) (= main_~x~0 36))} is VALID [2022-04-27 11:29:20,544 INFO L290 TraceCheckUtils]: 116: Hoare triple {4766#(and (= main_~y~0 10000000) (= main_~x~0 36))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4776#(and (= main_~y~0 10000000) (= main_~x~0 37))} is VALID [2022-04-27 11:29:20,544 INFO L290 TraceCheckUtils]: 117: Hoare triple {4776#(and (= main_~y~0 10000000) (= main_~x~0 37))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4776#(and (= main_~y~0 10000000) (= main_~x~0 37))} is VALID [2022-04-27 11:29:20,544 INFO L290 TraceCheckUtils]: 118: Hoare triple {4776#(and (= main_~y~0 10000000) (= main_~x~0 37))} assume !(~x~0 % 4294967296 >= 5000000); {4776#(and (= main_~y~0 10000000) (= main_~x~0 37))} is VALID [2022-04-27 11:29:20,545 INFO L290 TraceCheckUtils]: 119: Hoare triple {4776#(and (= main_~y~0 10000000) (= main_~x~0 37))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4786#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 37))} is VALID [2022-04-27 11:29:20,545 INFO L290 TraceCheckUtils]: 120: Hoare triple {4786#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 37))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4786#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 37))} is VALID [2022-04-27 11:29:20,545 INFO L290 TraceCheckUtils]: 121: Hoare triple {4786#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 37))} assume !(~x~0 % 4294967296 >= 5000000); {4786#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 37))} is VALID [2022-04-27 11:29:20,546 INFO L290 TraceCheckUtils]: 122: Hoare triple {4786#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 37))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4796#(and (= main_~y~0 10000000) (= main_~x~0 39))} is VALID [2022-04-27 11:29:20,546 INFO L290 TraceCheckUtils]: 123: Hoare triple {4796#(and (= main_~y~0 10000000) (= main_~x~0 39))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4796#(and (= main_~y~0 10000000) (= main_~x~0 39))} is VALID [2022-04-27 11:29:20,546 INFO L290 TraceCheckUtils]: 124: Hoare triple {4796#(and (= main_~y~0 10000000) (= main_~x~0 39))} assume !(~x~0 % 4294967296 >= 5000000); {4796#(and (= main_~y~0 10000000) (= main_~x~0 39))} is VALID [2022-04-27 11:29:20,547 INFO L290 TraceCheckUtils]: 125: Hoare triple {4796#(and (= main_~y~0 10000000) (= main_~x~0 39))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4806#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 39))} is VALID [2022-04-27 11:29:20,547 INFO L290 TraceCheckUtils]: 126: Hoare triple {4806#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 39))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4806#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 39))} is VALID [2022-04-27 11:29:20,547 INFO L290 TraceCheckUtils]: 127: Hoare triple {4806#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 39))} assume !(~x~0 % 4294967296 >= 5000000); {4806#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 39))} is VALID [2022-04-27 11:29:20,548 INFO L290 TraceCheckUtils]: 128: Hoare triple {4806#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 39))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4816#(and (= main_~y~0 10000000) (= 39 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:29:20,548 INFO L290 TraceCheckUtils]: 129: Hoare triple {4816#(and (= main_~y~0 10000000) (= 39 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4816#(and (= main_~y~0 10000000) (= 39 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:29:20,548 INFO L290 TraceCheckUtils]: 130: Hoare triple {4816#(and (= main_~y~0 10000000) (= 39 (+ (- 2) main_~x~0)))} assume !(~x~0 % 4294967296 >= 5000000); {4816#(and (= main_~y~0 10000000) (= 39 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:29:20,549 INFO L290 TraceCheckUtils]: 131: Hoare triple {4816#(and (= main_~y~0 10000000) (= 39 (+ (- 2) main_~x~0)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4826#(and (= (+ main_~x~0 (- 3)) 39) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,549 INFO L290 TraceCheckUtils]: 132: Hoare triple {4826#(and (= (+ main_~x~0 (- 3)) 39) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4826#(and (= (+ main_~x~0 (- 3)) 39) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,549 INFO L290 TraceCheckUtils]: 133: Hoare triple {4826#(and (= (+ main_~x~0 (- 3)) 39) (= main_~y~0 10000000))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4826#(and (= (+ main_~x~0 (- 3)) 39) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,550 INFO L290 TraceCheckUtils]: 134: Hoare triple {4826#(and (= (+ main_~x~0 (- 3)) 39) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4836#(and (= 39 (+ main_~x~0 (- 4))) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,550 INFO L290 TraceCheckUtils]: 135: Hoare triple {4836#(and (= 39 (+ main_~x~0 (- 4))) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4836#(and (= 39 (+ main_~x~0 (- 4))) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,550 INFO L290 TraceCheckUtils]: 136: Hoare triple {4836#(and (= 39 (+ main_~x~0 (- 4))) (= main_~y~0 10000000))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4836#(and (= 39 (+ main_~x~0 (- 4))) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,551 INFO L290 TraceCheckUtils]: 137: Hoare triple {4836#(and (= 39 (+ main_~x~0 (- 4))) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4846#(and (= 39 (+ main_~x~0 (- 5))) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,551 INFO L290 TraceCheckUtils]: 138: Hoare triple {4846#(and (= 39 (+ main_~x~0 (- 5))) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4846#(and (= 39 (+ main_~x~0 (- 5))) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,552 INFO L290 TraceCheckUtils]: 139: Hoare triple {4846#(and (= 39 (+ main_~x~0 (- 5))) (= main_~y~0 10000000))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4846#(and (= 39 (+ main_~x~0 (- 5))) (= main_~y~0 10000000))} is VALID [2022-04-27 11:29:20,552 INFO L290 TraceCheckUtils]: 140: Hoare triple {4846#(and (= 39 (+ main_~x~0 (- 5))) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4856#(and (= main_~y~0 10000000) (= 39 (+ main_~x~0 (- 6))))} is VALID [2022-04-27 11:29:20,552 INFO L290 TraceCheckUtils]: 141: Hoare triple {4856#(and (= main_~y~0 10000000) (= 39 (+ main_~x~0 (- 6))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4856#(and (= main_~y~0 10000000) (= 39 (+ main_~x~0 (- 6))))} is VALID [2022-04-27 11:29:20,553 INFO L290 TraceCheckUtils]: 142: Hoare triple {4856#(and (= main_~y~0 10000000) (= 39 (+ main_~x~0 (- 6))))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4856#(and (= main_~y~0 10000000) (= 39 (+ main_~x~0 (- 6))))} is VALID [2022-04-27 11:29:20,553 INFO L290 TraceCheckUtils]: 143: Hoare triple {4856#(and (= main_~y~0 10000000) (= 39 (+ main_~x~0 (- 6))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4866#(and (= main_~y~0 10000000) (= main_~x~0 46))} is VALID [2022-04-27 11:29:20,553 INFO L290 TraceCheckUtils]: 144: Hoare triple {4866#(and (= main_~y~0 10000000) (= main_~x~0 46))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4870#(= main_~x~0 46)} is VALID [2022-04-27 11:29:20,553 INFO L290 TraceCheckUtils]: 145: Hoare triple {4870#(= main_~x~0 46)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4340#false} is VALID [2022-04-27 11:29:20,554 INFO L290 TraceCheckUtils]: 146: Hoare triple {4340#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4340#false} is VALID [2022-04-27 11:29:20,554 INFO L290 TraceCheckUtils]: 147: Hoare triple {4340#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {4340#false} is VALID [2022-04-27 11:29:20,554 INFO L272 TraceCheckUtils]: 148: Hoare triple {4340#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {4340#false} is VALID [2022-04-27 11:29:20,554 INFO L290 TraceCheckUtils]: 149: Hoare triple {4340#false} ~cond := #in~cond; {4340#false} is VALID [2022-04-27 11:29:20,554 INFO L290 TraceCheckUtils]: 150: Hoare triple {4340#false} assume 0 == ~cond; {4340#false} is VALID [2022-04-27 11:29:20,554 INFO L290 TraceCheckUtils]: 151: Hoare triple {4340#false} assume !false; {4340#false} is VALID [2022-04-27 11:29:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 93 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:29:20,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:29:26,003 INFO L290 TraceCheckUtils]: 151: Hoare triple {4340#false} assume !false; {4340#false} is VALID [2022-04-27 11:29:26,003 INFO L290 TraceCheckUtils]: 150: Hoare triple {4340#false} assume 0 == ~cond; {4340#false} is VALID [2022-04-27 11:29:26,003 INFO L290 TraceCheckUtils]: 149: Hoare triple {4340#false} ~cond := #in~cond; {4340#false} is VALID [2022-04-27 11:29:26,003 INFO L272 TraceCheckUtils]: 148: Hoare triple {4340#false} call __VERIFIER_assert((if 0 == ~z~0 % 4294967296 then 1 else 0)); {4340#false} is VALID [2022-04-27 11:29:26,003 INFO L290 TraceCheckUtils]: 147: Hoare triple {4340#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {4340#false} is VALID [2022-04-27 11:29:26,003 INFO L290 TraceCheckUtils]: 146: Hoare triple {4340#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4340#false} is VALID [2022-04-27 11:29:26,003 INFO L290 TraceCheckUtils]: 145: Hoare triple {4910#(not (<= 5000000 (mod main_~x~0 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4340#false} is VALID [2022-04-27 11:29:26,004 INFO L290 TraceCheckUtils]: 144: Hoare triple {4914#(or (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4910#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:29:26,004 INFO L290 TraceCheckUtils]: 143: Hoare triple {4918#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4914#(or (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 11:29:26,005 INFO L290 TraceCheckUtils]: 142: Hoare triple {4918#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4918#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} is VALID [2022-04-27 11:29:26,005 INFO L290 TraceCheckUtils]: 141: Hoare triple {4918#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4918#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} is VALID [2022-04-27 11:29:26,006 INFO L290 TraceCheckUtils]: 140: Hoare triple {4928#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4918#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} is VALID [2022-04-27 11:29:26,007 INFO L290 TraceCheckUtils]: 139: Hoare triple {4928#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4928#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,007 INFO L290 TraceCheckUtils]: 138: Hoare triple {4928#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4928#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,008 INFO L290 TraceCheckUtils]: 137: Hoare triple {4938#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4928#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,008 INFO L290 TraceCheckUtils]: 136: Hoare triple {4938#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4938#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} is VALID [2022-04-27 11:29:26,009 INFO L290 TraceCheckUtils]: 135: Hoare triple {4938#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4938#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} is VALID [2022-04-27 11:29:26,010 INFO L290 TraceCheckUtils]: 134: Hoare triple {4948#(or (not (< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4938#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} is VALID [2022-04-27 11:29:26,010 INFO L290 TraceCheckUtils]: 133: Hoare triple {4948#(or (not (< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4948#(or (not (< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} is VALID [2022-04-27 11:29:26,010 INFO L290 TraceCheckUtils]: 132: Hoare triple {4948#(or (not (< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4948#(or (not (< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} is VALID [2022-04-27 11:29:26,011 INFO L290 TraceCheckUtils]: 131: Hoare triple {4958#(or (not (< (mod (+ 5 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4948#(or (not (< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} is VALID [2022-04-27 11:29:26,011 INFO L290 TraceCheckUtils]: 130: Hoare triple {4958#(or (not (< (mod (+ 5 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {4958#(or (not (< (mod (+ 5 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,012 INFO L290 TraceCheckUtils]: 129: Hoare triple {4958#(or (not (< (mod (+ 5 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4958#(or (not (< (mod (+ 5 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,013 INFO L290 TraceCheckUtils]: 128: Hoare triple {4968#(or (not (< (mod (+ main_~x~0 6) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4958#(or (not (< (mod (+ 5 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,013 INFO L290 TraceCheckUtils]: 127: Hoare triple {4968#(or (not (< (mod (+ main_~x~0 6) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {4968#(or (not (< (mod (+ main_~x~0 6) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-27 11:29:26,013 INFO L290 TraceCheckUtils]: 126: Hoare triple {4968#(or (not (< (mod (+ main_~x~0 6) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4968#(or (not (< (mod (+ main_~x~0 6) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-27 11:29:26,016 INFO L290 TraceCheckUtils]: 125: Hoare triple {4978#(or (not (< (mod (+ 7 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4968#(or (not (< (mod (+ main_~x~0 6) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-27 11:29:26,017 INFO L290 TraceCheckUtils]: 124: Hoare triple {4978#(or (not (< (mod (+ 7 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {4978#(or (not (< (mod (+ 7 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,017 INFO L290 TraceCheckUtils]: 123: Hoare triple {4978#(or (not (< (mod (+ 7 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4978#(or (not (< (mod (+ 7 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,018 INFO L290 TraceCheckUtils]: 122: Hoare triple {4988#(or (not (< (mod (+ main_~x~0 8) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4978#(or (not (< (mod (+ 7 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,018 INFO L290 TraceCheckUtils]: 121: Hoare triple {4988#(or (not (< (mod (+ main_~x~0 8) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {4988#(or (not (< (mod (+ main_~x~0 8) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} is VALID [2022-04-27 11:29:26,019 INFO L290 TraceCheckUtils]: 120: Hoare triple {4988#(or (not (< (mod (+ main_~x~0 8) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4988#(or (not (< (mod (+ main_~x~0 8) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} is VALID [2022-04-27 11:29:26,019 INFO L290 TraceCheckUtils]: 119: Hoare triple {4998#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (not (< (mod (+ main_~x~0 9) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4988#(or (not (< (mod (+ main_~x~0 8) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} is VALID [2022-04-27 11:29:26,020 INFO L290 TraceCheckUtils]: 118: Hoare triple {4998#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (not (< (mod (+ main_~x~0 9) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {4998#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (not (< (mod (+ main_~x~0 9) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,020 INFO L290 TraceCheckUtils]: 117: Hoare triple {4998#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (not (< (mod (+ main_~x~0 9) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4998#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (not (< (mod (+ main_~x~0 9) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,021 INFO L290 TraceCheckUtils]: 116: Hoare triple {5008#(or (not (< (mod (+ main_~x~0 10) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4998#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (not (< (mod (+ main_~x~0 9) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,021 INFO L290 TraceCheckUtils]: 115: Hoare triple {5008#(or (not (< (mod (+ main_~x~0 10) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5008#(or (not (< (mod (+ main_~x~0 10) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))))} is VALID [2022-04-27 11:29:26,021 INFO L290 TraceCheckUtils]: 114: Hoare triple {5008#(or (not (< (mod (+ main_~x~0 10) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5008#(or (not (< (mod (+ main_~x~0 10) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))))} is VALID [2022-04-27 11:29:26,022 INFO L290 TraceCheckUtils]: 113: Hoare triple {5018#(or (not (< (mod (+ main_~x~0 11) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5008#(or (not (< (mod (+ main_~x~0 10) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))))} is VALID [2022-04-27 11:29:26,022 INFO L290 TraceCheckUtils]: 112: Hoare triple {5018#(or (not (< (mod (+ main_~x~0 11) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5018#(or (not (< (mod (+ main_~x~0 11) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))))} is VALID [2022-04-27 11:29:26,022 INFO L290 TraceCheckUtils]: 111: Hoare triple {5018#(or (not (< (mod (+ main_~x~0 11) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5018#(or (not (< (mod (+ main_~x~0 11) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))))} is VALID [2022-04-27 11:29:26,023 INFO L290 TraceCheckUtils]: 110: Hoare triple {5028#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (not (< (mod (+ main_~x~0 12) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5018#(or (not (< (mod (+ main_~x~0 11) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))))} is VALID [2022-04-27 11:29:26,023 INFO L290 TraceCheckUtils]: 109: Hoare triple {5028#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (not (< (mod (+ main_~x~0 12) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5028#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (not (< (mod (+ main_~x~0 12) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,024 INFO L290 TraceCheckUtils]: 108: Hoare triple {5028#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (not (< (mod (+ main_~x~0 12) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5028#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (not (< (mod (+ main_~x~0 12) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,024 INFO L290 TraceCheckUtils]: 107: Hoare triple {5038#(or (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))) (not (< (mod (+ main_~x~0 13) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5028#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (not (< (mod (+ main_~x~0 12) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,025 INFO L290 TraceCheckUtils]: 106: Hoare triple {5038#(or (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))) (not (< (mod (+ main_~x~0 13) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5038#(or (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))) (not (< (mod (+ main_~x~0 13) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,025 INFO L290 TraceCheckUtils]: 105: Hoare triple {5038#(or (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))) (not (< (mod (+ main_~x~0 13) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5038#(or (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))) (not (< (mod (+ main_~x~0 13) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,026 INFO L290 TraceCheckUtils]: 104: Hoare triple {5048#(or (not (< (mod (+ main_~x~0 14) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5038#(or (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))) (not (< (mod (+ main_~x~0 13) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,026 INFO L290 TraceCheckUtils]: 103: Hoare triple {5048#(or (not (< (mod (+ main_~x~0 14) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5048#(or (not (< (mod (+ main_~x~0 14) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} is VALID [2022-04-27 11:29:26,026 INFO L290 TraceCheckUtils]: 102: Hoare triple {5048#(or (not (< (mod (+ main_~x~0 14) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5048#(or (not (< (mod (+ main_~x~0 14) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} is VALID [2022-04-27 11:29:26,027 INFO L290 TraceCheckUtils]: 101: Hoare triple {5058#(or (not (< (mod (+ main_~x~0 15) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5048#(or (not (< (mod (+ main_~x~0 14) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} is VALID [2022-04-27 11:29:26,027 INFO L290 TraceCheckUtils]: 100: Hoare triple {5058#(or (not (< (mod (+ main_~x~0 15) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5058#(or (not (< (mod (+ main_~x~0 15) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} is VALID [2022-04-27 11:29:26,028 INFO L290 TraceCheckUtils]: 99: Hoare triple {5058#(or (not (< (mod (+ main_~x~0 15) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5058#(or (not (< (mod (+ main_~x~0 15) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} is VALID [2022-04-27 11:29:26,028 INFO L290 TraceCheckUtils]: 98: Hoare triple {5068#(or (not (< (mod (+ main_~x~0 16) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5058#(or (not (< (mod (+ main_~x~0 15) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} is VALID [2022-04-27 11:29:26,029 INFO L290 TraceCheckUtils]: 97: Hoare triple {5068#(or (not (< (mod (+ main_~x~0 16) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5068#(or (not (< (mod (+ main_~x~0 16) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} is VALID [2022-04-27 11:29:26,029 INFO L290 TraceCheckUtils]: 96: Hoare triple {5068#(or (not (< (mod (+ main_~x~0 16) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5068#(or (not (< (mod (+ main_~x~0 16) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} is VALID [2022-04-27 11:29:26,030 INFO L290 TraceCheckUtils]: 95: Hoare triple {5078#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (not (< (mod (+ main_~x~0 17) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5068#(or (not (< (mod (+ main_~x~0 16) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} is VALID [2022-04-27 11:29:26,030 INFO L290 TraceCheckUtils]: 94: Hoare triple {5078#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (not (< (mod (+ main_~x~0 17) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5078#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (not (< (mod (+ main_~x~0 17) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,030 INFO L290 TraceCheckUtils]: 93: Hoare triple {5078#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (not (< (mod (+ main_~x~0 17) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5078#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (not (< (mod (+ main_~x~0 17) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,031 INFO L290 TraceCheckUtils]: 92: Hoare triple {5088#(or (not (< (mod (+ main_~x~0 18) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5078#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (not (< (mod (+ main_~x~0 17) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,031 INFO L290 TraceCheckUtils]: 91: Hoare triple {5088#(or (not (< (mod (+ main_~x~0 18) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5088#(or (not (< (mod (+ main_~x~0 18) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} is VALID [2022-04-27 11:29:26,032 INFO L290 TraceCheckUtils]: 90: Hoare triple {5088#(or (not (< (mod (+ main_~x~0 18) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5088#(or (not (< (mod (+ main_~x~0 18) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} is VALID [2022-04-27 11:29:26,032 INFO L290 TraceCheckUtils]: 89: Hoare triple {5098#(or (not (< (mod (+ 19 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5088#(or (not (< (mod (+ main_~x~0 18) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} is VALID [2022-04-27 11:29:26,033 INFO L290 TraceCheckUtils]: 88: Hoare triple {5098#(or (not (< (mod (+ 19 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5098#(or (not (< (mod (+ 19 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,035 INFO L290 TraceCheckUtils]: 87: Hoare triple {5098#(or (not (< (mod (+ 19 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5098#(or (not (< (mod (+ 19 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,036 INFO L290 TraceCheckUtils]: 86: Hoare triple {5108#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (not (< (mod (+ main_~x~0 20) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5098#(or (not (< (mod (+ 19 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,036 INFO L290 TraceCheckUtils]: 85: Hoare triple {5108#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (not (< (mod (+ main_~x~0 20) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5108#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (not (< (mod (+ main_~x~0 20) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,036 INFO L290 TraceCheckUtils]: 84: Hoare triple {5108#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (not (< (mod (+ main_~x~0 20) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5108#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (not (< (mod (+ main_~x~0 20) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,037 INFO L290 TraceCheckUtils]: 83: Hoare triple {5118#(or (not (<= 5000000 (mod (+ main_~x~0 21) 4294967296))) (not (< (mod (+ main_~x~0 21) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5108#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (not (< (mod (+ main_~x~0 20) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,038 INFO L290 TraceCheckUtils]: 82: Hoare triple {5118#(or (not (<= 5000000 (mod (+ main_~x~0 21) 4294967296))) (not (< (mod (+ main_~x~0 21) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5118#(or (not (<= 5000000 (mod (+ main_~x~0 21) 4294967296))) (not (< (mod (+ main_~x~0 21) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,038 INFO L290 TraceCheckUtils]: 81: Hoare triple {5118#(or (not (<= 5000000 (mod (+ main_~x~0 21) 4294967296))) (not (< (mod (+ main_~x~0 21) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5118#(or (not (<= 5000000 (mod (+ main_~x~0 21) 4294967296))) (not (< (mod (+ main_~x~0 21) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,039 INFO L290 TraceCheckUtils]: 80: Hoare triple {5128#(or (not (<= 5000000 (mod (+ main_~x~0 22) 4294967296))) (not (< (mod (+ main_~x~0 22) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5118#(or (not (<= 5000000 (mod (+ main_~x~0 21) 4294967296))) (not (< (mod (+ main_~x~0 21) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,040 INFO L290 TraceCheckUtils]: 79: Hoare triple {5128#(or (not (<= 5000000 (mod (+ main_~x~0 22) 4294967296))) (not (< (mod (+ main_~x~0 22) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5128#(or (not (<= 5000000 (mod (+ main_~x~0 22) 4294967296))) (not (< (mod (+ main_~x~0 22) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,040 INFO L290 TraceCheckUtils]: 78: Hoare triple {5128#(or (not (<= 5000000 (mod (+ main_~x~0 22) 4294967296))) (not (< (mod (+ main_~x~0 22) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5128#(or (not (<= 5000000 (mod (+ main_~x~0 22) 4294967296))) (not (< (mod (+ main_~x~0 22) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,041 INFO L290 TraceCheckUtils]: 77: Hoare triple {5138#(or (not (< (mod (+ 23 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 23 main_~x~0) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5128#(or (not (<= 5000000 (mod (+ main_~x~0 22) 4294967296))) (not (< (mod (+ main_~x~0 22) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,041 INFO L290 TraceCheckUtils]: 76: Hoare triple {5138#(or (not (< (mod (+ 23 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 23 main_~x~0) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5138#(or (not (< (mod (+ 23 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 23 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,042 INFO L290 TraceCheckUtils]: 75: Hoare triple {5138#(or (not (< (mod (+ 23 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 23 main_~x~0) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5138#(or (not (< (mod (+ 23 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 23 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,043 INFO L290 TraceCheckUtils]: 74: Hoare triple {5148#(or (not (<= 5000000 (mod (+ main_~x~0 24) 4294967296))) (not (< (mod (+ main_~x~0 24) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5138#(or (not (< (mod (+ 23 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 23 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,043 INFO L290 TraceCheckUtils]: 73: Hoare triple {5148#(or (not (<= 5000000 (mod (+ main_~x~0 24) 4294967296))) (not (< (mod (+ main_~x~0 24) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5148#(or (not (<= 5000000 (mod (+ main_~x~0 24) 4294967296))) (not (< (mod (+ main_~x~0 24) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,043 INFO L290 TraceCheckUtils]: 72: Hoare triple {5148#(or (not (<= 5000000 (mod (+ main_~x~0 24) 4294967296))) (not (< (mod (+ main_~x~0 24) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5148#(or (not (<= 5000000 (mod (+ main_~x~0 24) 4294967296))) (not (< (mod (+ main_~x~0 24) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,044 INFO L290 TraceCheckUtils]: 71: Hoare triple {5158#(or (not (<= 5000000 (mod (+ main_~x~0 25) 4294967296))) (not (< (mod (+ main_~x~0 25) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5148#(or (not (<= 5000000 (mod (+ main_~x~0 24) 4294967296))) (not (< (mod (+ main_~x~0 24) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,044 INFO L290 TraceCheckUtils]: 70: Hoare triple {5158#(or (not (<= 5000000 (mod (+ main_~x~0 25) 4294967296))) (not (< (mod (+ main_~x~0 25) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5158#(or (not (<= 5000000 (mod (+ main_~x~0 25) 4294967296))) (not (< (mod (+ main_~x~0 25) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,045 INFO L290 TraceCheckUtils]: 69: Hoare triple {5158#(or (not (<= 5000000 (mod (+ main_~x~0 25) 4294967296))) (not (< (mod (+ main_~x~0 25) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5158#(or (not (<= 5000000 (mod (+ main_~x~0 25) 4294967296))) (not (< (mod (+ main_~x~0 25) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,045 INFO L290 TraceCheckUtils]: 68: Hoare triple {5168#(or (not (< (mod (+ main_~x~0 26) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 26) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5158#(or (not (<= 5000000 (mod (+ main_~x~0 25) 4294967296))) (not (< (mod (+ main_~x~0 25) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,046 INFO L290 TraceCheckUtils]: 67: Hoare triple {5168#(or (not (< (mod (+ main_~x~0 26) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 26) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5168#(or (not (< (mod (+ main_~x~0 26) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 26) 4294967296))))} is VALID [2022-04-27 11:29:26,046 INFO L290 TraceCheckUtils]: 66: Hoare triple {5168#(or (not (< (mod (+ main_~x~0 26) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 26) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5168#(or (not (< (mod (+ main_~x~0 26) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 26) 4294967296))))} is VALID [2022-04-27 11:29:26,047 INFO L290 TraceCheckUtils]: 65: Hoare triple {5178#(or (not (< (mod (+ main_~x~0 27) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 27) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5168#(or (not (< (mod (+ main_~x~0 26) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 26) 4294967296))))} is VALID [2022-04-27 11:29:26,047 INFO L290 TraceCheckUtils]: 64: Hoare triple {5178#(or (not (< (mod (+ main_~x~0 27) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 27) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5178#(or (not (< (mod (+ main_~x~0 27) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 27) 4294967296))))} is VALID [2022-04-27 11:29:26,047 INFO L290 TraceCheckUtils]: 63: Hoare triple {5178#(or (not (< (mod (+ main_~x~0 27) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 27) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5178#(or (not (< (mod (+ main_~x~0 27) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 27) 4294967296))))} is VALID [2022-04-27 11:29:26,048 INFO L290 TraceCheckUtils]: 62: Hoare triple {5188#(or (not (<= 5000000 (mod (+ main_~x~0 28) 4294967296))) (not (< (mod (+ main_~x~0 28) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5178#(or (not (< (mod (+ main_~x~0 27) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 27) 4294967296))))} is VALID [2022-04-27 11:29:26,048 INFO L290 TraceCheckUtils]: 61: Hoare triple {5188#(or (not (<= 5000000 (mod (+ main_~x~0 28) 4294967296))) (not (< (mod (+ main_~x~0 28) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5188#(or (not (<= 5000000 (mod (+ main_~x~0 28) 4294967296))) (not (< (mod (+ main_~x~0 28) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,049 INFO L290 TraceCheckUtils]: 60: Hoare triple {5188#(or (not (<= 5000000 (mod (+ main_~x~0 28) 4294967296))) (not (< (mod (+ main_~x~0 28) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5188#(or (not (<= 5000000 (mod (+ main_~x~0 28) 4294967296))) (not (< (mod (+ main_~x~0 28) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,049 INFO L290 TraceCheckUtils]: 59: Hoare triple {5198#(or (not (< (mod (+ 29 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 29 main_~x~0) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5188#(or (not (<= 5000000 (mod (+ main_~x~0 28) 4294967296))) (not (< (mod (+ main_~x~0 28) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,050 INFO L290 TraceCheckUtils]: 58: Hoare triple {5198#(or (not (< (mod (+ 29 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 29 main_~x~0) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5198#(or (not (< (mod (+ 29 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 29 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,050 INFO L290 TraceCheckUtils]: 57: Hoare triple {5198#(or (not (< (mod (+ 29 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 29 main_~x~0) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5198#(or (not (< (mod (+ 29 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 29 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,050 INFO L290 TraceCheckUtils]: 56: Hoare triple {5208#(or (not (<= 5000000 (mod (+ 30 main_~x~0) 4294967296))) (not (< (mod (+ 30 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5198#(or (not (< (mod (+ 29 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 29 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,051 INFO L290 TraceCheckUtils]: 55: Hoare triple {5208#(or (not (<= 5000000 (mod (+ 30 main_~x~0) 4294967296))) (not (< (mod (+ 30 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5208#(or (not (<= 5000000 (mod (+ 30 main_~x~0) 4294967296))) (not (< (mod (+ 30 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,051 INFO L290 TraceCheckUtils]: 54: Hoare triple {5208#(or (not (<= 5000000 (mod (+ 30 main_~x~0) 4294967296))) (not (< (mod (+ 30 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(or (not (<= 5000000 (mod (+ 30 main_~x~0) 4294967296))) (not (< (mod (+ 30 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,053 INFO L290 TraceCheckUtils]: 53: Hoare triple {5218#(or (not (< (mod (+ main_~x~0 31) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 31) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(or (not (<= 5000000 (mod (+ 30 main_~x~0) 4294967296))) (not (< (mod (+ 30 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,053 INFO L290 TraceCheckUtils]: 52: Hoare triple {5218#(or (not (< (mod (+ main_~x~0 31) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 31) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5218#(or (not (< (mod (+ main_~x~0 31) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 31) 4294967296))))} is VALID [2022-04-27 11:29:26,054 INFO L290 TraceCheckUtils]: 51: Hoare triple {5218#(or (not (< (mod (+ main_~x~0 31) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 31) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5218#(or (not (< (mod (+ main_~x~0 31) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 31) 4294967296))))} is VALID [2022-04-27 11:29:26,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {5228#(or (not (< (mod (+ 32 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 32 main_~x~0) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5218#(or (not (< (mod (+ main_~x~0 31) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 31) 4294967296))))} is VALID [2022-04-27 11:29:26,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {5228#(or (not (< (mod (+ 32 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 32 main_~x~0) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5228#(or (not (< (mod (+ 32 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 32 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,057 INFO L290 TraceCheckUtils]: 48: Hoare triple {5228#(or (not (< (mod (+ 32 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 32 main_~x~0) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5228#(or (not (< (mod (+ 32 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 32 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {5238#(or (not (<= 5000000 (mod (+ main_~x~0 33) 4294967296))) (not (< (mod (+ main_~x~0 33) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5228#(or (not (< (mod (+ 32 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 32 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {5238#(or (not (<= 5000000 (mod (+ main_~x~0 33) 4294967296))) (not (< (mod (+ main_~x~0 33) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5238#(or (not (<= 5000000 (mod (+ main_~x~0 33) 4294967296))) (not (< (mod (+ main_~x~0 33) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,058 INFO L290 TraceCheckUtils]: 45: Hoare triple {5238#(or (not (<= 5000000 (mod (+ main_~x~0 33) 4294967296))) (not (< (mod (+ main_~x~0 33) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5238#(or (not (<= 5000000 (mod (+ main_~x~0 33) 4294967296))) (not (< (mod (+ main_~x~0 33) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {5248#(or (not (<= 5000000 (mod (+ main_~x~0 34) 4294967296))) (not (< (mod (+ main_~x~0 34) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5238#(or (not (<= 5000000 (mod (+ main_~x~0 33) 4294967296))) (not (< (mod (+ main_~x~0 33) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,059 INFO L290 TraceCheckUtils]: 43: Hoare triple {5248#(or (not (<= 5000000 (mod (+ main_~x~0 34) 4294967296))) (not (< (mod (+ main_~x~0 34) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5248#(or (not (<= 5000000 (mod (+ main_~x~0 34) 4294967296))) (not (< (mod (+ main_~x~0 34) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {5248#(or (not (<= 5000000 (mod (+ main_~x~0 34) 4294967296))) (not (< (mod (+ main_~x~0 34) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5248#(or (not (<= 5000000 (mod (+ main_~x~0 34) 4294967296))) (not (< (mod (+ main_~x~0 34) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,061 INFO L290 TraceCheckUtils]: 41: Hoare triple {5258#(or (not (< (mod (+ 35 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 35 main_~x~0) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5248#(or (not (<= 5000000 (mod (+ main_~x~0 34) 4294967296))) (not (< (mod (+ main_~x~0 34) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,061 INFO L290 TraceCheckUtils]: 40: Hoare triple {5258#(or (not (< (mod (+ 35 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 35 main_~x~0) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5258#(or (not (< (mod (+ 35 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 35 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,062 INFO L290 TraceCheckUtils]: 39: Hoare triple {5258#(or (not (< (mod (+ 35 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 35 main_~x~0) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5258#(or (not (< (mod (+ 35 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 35 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {5268#(or (not (<= 5000000 (mod (+ main_~x~0 36) 4294967296))) (not (< (mod (+ main_~x~0 36) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5258#(or (not (< (mod (+ 35 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 35 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {5268#(or (not (<= 5000000 (mod (+ main_~x~0 36) 4294967296))) (not (< (mod (+ main_~x~0 36) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5268#(or (not (<= 5000000 (mod (+ main_~x~0 36) 4294967296))) (not (< (mod (+ main_~x~0 36) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {5268#(or (not (<= 5000000 (mod (+ main_~x~0 36) 4294967296))) (not (< (mod (+ main_~x~0 36) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5268#(or (not (<= 5000000 (mod (+ main_~x~0 36) 4294967296))) (not (< (mod (+ main_~x~0 36) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {5278#(or (not (< (mod (+ main_~x~0 37) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 37) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5268#(or (not (<= 5000000 (mod (+ main_~x~0 36) 4294967296))) (not (< (mod (+ main_~x~0 36) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {5278#(or (not (< (mod (+ main_~x~0 37) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 37) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5278#(or (not (< (mod (+ main_~x~0 37) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 37) 4294967296))))} is VALID [2022-04-27 11:29:26,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {5278#(or (not (< (mod (+ main_~x~0 37) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 37) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5278#(or (not (< (mod (+ main_~x~0 37) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 37) 4294967296))))} is VALID [2022-04-27 11:29:26,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {5288#(or (not (< (mod (+ main_~x~0 38) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 38) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5278#(or (not (< (mod (+ main_~x~0 37) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 37) 4294967296))))} is VALID [2022-04-27 11:29:26,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {5288#(or (not (< (mod (+ main_~x~0 38) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 38) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5288#(or (not (< (mod (+ main_~x~0 38) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 38) 4294967296))))} is VALID [2022-04-27 11:29:26,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {5288#(or (not (< (mod (+ main_~x~0 38) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 38) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5288#(or (not (< (mod (+ main_~x~0 38) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 38) 4294967296))))} is VALID [2022-04-27 11:29:26,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {5298#(or (not (< (mod (+ main_~x~0 39) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 39) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5288#(or (not (< (mod (+ main_~x~0 38) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 38) 4294967296))))} is VALID [2022-04-27 11:29:26,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {5298#(or (not (< (mod (+ main_~x~0 39) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 39) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5298#(or (not (< (mod (+ main_~x~0 39) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 39) 4294967296))))} is VALID [2022-04-27 11:29:26,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {5298#(or (not (< (mod (+ main_~x~0 39) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 39) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5298#(or (not (< (mod (+ main_~x~0 39) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 39) 4294967296))))} is VALID [2022-04-27 11:29:26,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {5308#(or (not (< (mod (+ 40 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 40 main_~x~0) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5298#(or (not (< (mod (+ main_~x~0 39) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 39) 4294967296))))} is VALID [2022-04-27 11:29:26,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {5308#(or (not (< (mod (+ 40 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 40 main_~x~0) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5308#(or (not (< (mod (+ 40 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 40 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {5308#(or (not (< (mod (+ 40 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 40 main_~x~0) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5308#(or (not (< (mod (+ 40 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 40 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {5318#(or (not (< (mod (+ 41 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 41 main_~x~0) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5308#(or (not (< (mod (+ 40 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 40 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {5318#(or (not (< (mod (+ 41 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 41 main_~x~0) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5318#(or (not (< (mod (+ 41 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 41 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {5318#(or (not (< (mod (+ 41 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 41 main_~x~0) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5318#(or (not (< (mod (+ 41 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 41 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {5328#(or (not (<= 5000000 (mod (+ 42 main_~x~0) 4294967296))) (not (< (mod (+ 42 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5318#(or (not (< (mod (+ 41 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 41 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {5328#(or (not (<= 5000000 (mod (+ 42 main_~x~0) 4294967296))) (not (< (mod (+ 42 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5328#(or (not (<= 5000000 (mod (+ 42 main_~x~0) 4294967296))) (not (< (mod (+ 42 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {5328#(or (not (<= 5000000 (mod (+ 42 main_~x~0) 4294967296))) (not (< (mod (+ 42 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5328#(or (not (<= 5000000 (mod (+ 42 main_~x~0) 4294967296))) (not (< (mod (+ 42 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {5338#(or (not (<= 5000000 (mod (+ main_~x~0 43) 4294967296))) (not (< (mod (+ main_~x~0 43) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5328#(or (not (<= 5000000 (mod (+ 42 main_~x~0) 4294967296))) (not (< (mod (+ 42 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {5338#(or (not (<= 5000000 (mod (+ main_~x~0 43) 4294967296))) (not (< (mod (+ main_~x~0 43) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5338#(or (not (<= 5000000 (mod (+ main_~x~0 43) 4294967296))) (not (< (mod (+ main_~x~0 43) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {5338#(or (not (<= 5000000 (mod (+ main_~x~0 43) 4294967296))) (not (< (mod (+ main_~x~0 43) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5338#(or (not (<= 5000000 (mod (+ main_~x~0 43) 4294967296))) (not (< (mod (+ main_~x~0 43) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {5348#(or (not (< (mod (+ 44 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 44 main_~x~0) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5338#(or (not (<= 5000000 (mod (+ main_~x~0 43) 4294967296))) (not (< (mod (+ main_~x~0 43) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:29:26,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {5348#(or (not (< (mod (+ 44 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 44 main_~x~0) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5348#(or (not (< (mod (+ 44 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 44 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {5348#(or (not (< (mod (+ 44 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 44 main_~x~0) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5348#(or (not (< (mod (+ 44 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 44 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {5358#(or (not (< (mod (+ main_~x~0 45) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 45) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5348#(or (not (< (mod (+ 44 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 44 main_~x~0) 4294967296))))} is VALID [2022-04-27 11:29:26,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {5358#(or (not (< (mod (+ main_~x~0 45) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 45) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5358#(or (not (< (mod (+ main_~x~0 45) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 45) 4294967296))))} is VALID [2022-04-27 11:29:26,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {5358#(or (not (< (mod (+ main_~x~0 45) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 45) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5358#(or (not (< (mod (+ main_~x~0 45) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 45) 4294967296))))} is VALID [2022-04-27 11:29:26,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {5368#(or (not (< (mod (+ main_~x~0 46) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 46) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5358#(or (not (< (mod (+ main_~x~0 45) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 45) 4294967296))))} is VALID [2022-04-27 11:29:26,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {5368#(or (not (< (mod (+ main_~x~0 46) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 46) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {5368#(or (not (< (mod (+ main_~x~0 46) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 46) 4294967296))))} is VALID [2022-04-27 11:29:26,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {5368#(or (not (< (mod (+ main_~x~0 46) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 46) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5368#(or (not (< (mod (+ main_~x~0 46) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 46) 4294967296))))} is VALID [2022-04-27 11:29:26,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {4339#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {5368#(or (not (< (mod (+ main_~x~0 46) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 46) 4294967296))))} is VALID [2022-04-27 11:29:26,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {4339#true} call #t~ret6 := main(); {4339#true} is VALID [2022-04-27 11:29:26,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4339#true} {4339#true} #42#return; {4339#true} is VALID [2022-04-27 11:29:26,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {4339#true} assume true; {4339#true} is VALID [2022-04-27 11:29:26,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {4339#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(17, 2);call #Ultimate.allocInit(12, 3); {4339#true} is VALID [2022-04-27 11:29:26,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {4339#true} call ULTIMATE.init(); {4339#true} is VALID [2022-04-27 11:29:26,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 93 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:29:26,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236216917] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:29:26,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:29:26,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 50, 50] total 142 [2022-04-27 11:29:26,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320211148] [2022-04-27 11:29:26,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:29:26,086 INFO L78 Accepts]: Start accepts. Automaton has has 142 states, 142 states have (on average 2.964788732394366) internal successors, (421), 141 states have internal predecessors, (421), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2022-04-27 11:29:26,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:29:26,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 142 states, 142 states have (on average 2.964788732394366) internal successors, (421), 141 states have internal predecessors, (421), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:26,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 426 edges. 426 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:29:26,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2022-04-27 11:29:26,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:29:26,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2022-04-27 11:29:26,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4778, Invalid=15244, Unknown=0, NotChecked=0, Total=20022 [2022-04-27 11:29:26,414 INFO L87 Difference]: Start difference. First operand 153 states and 158 transitions. Second operand has 142 states, 142 states have (on average 2.964788732394366) internal successors, (421), 141 states have internal predecessors, (421), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:40,370 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~y~0 4294967296))) (and (let ((.cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse0 .cse1)) (not (<= 5000000 .cse0)))) (let ((.cse2 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (not (< .cse2 .cse1)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse3 (mod (+ 3 c_main_~x~0) 4294967296))) (or (not (< .cse3 .cse1)) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (<= 5000000 .cse4)) (not (< .cse4 .cse1)))) (let ((.cse5 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (not (< .cse5 .cse1)))) (let ((.cse6 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse6)) (not (< .cse6 .cse1)))) (let ((.cse7 (mod (+ 9 c_main_~x~0) 4294967296))) (or (not (< .cse7 .cse1)) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse8 .cse1)) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse9)) (not (< .cse9 .cse1)))) (let ((.cse10 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (not (< .cse10 .cse1)))) (let ((.cse11 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse11 .cse1)) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse12 .cse1)) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse13 .cse1)) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 6 c_main_~x~0) 4294967296))) (or (not (< .cse14 .cse1)) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (not (< .cse15 .cse1)))) (let ((.cse16 (mod (+ 36 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse16)) (not (< .cse16 .cse1)))) (let ((.cse17 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse17 .cse1)) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse18 .cse1)) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (< .cse19 .cse1)) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse20)) (not (< .cse20 .cse1)))) (let ((.cse21 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (not (< .cse21 .cse1)))) (let ((.cse22 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse22 .cse1)) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse23 .cse1)) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ 39 c_main_~x~0) 4294967296))) (or (not (< .cse24 .cse1)) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ 13 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse25)) (not (< .cse25 .cse1)))) (let ((.cse26 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (< .cse26 .cse1)) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ c_main_~x~0 11) 4294967296))) (or (not (< .cse27 .cse1)) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse28 .cse1)) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (not (< .cse29 .cse1)))) (let ((.cse30 (mod (+ 12 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (not (< .cse30 .cse1)))) (let ((.cse31 (mod (+ 4 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse31)) (not (< .cse31 .cse1)))) (let ((.cse32 (mod (+ 16 c_main_~x~0) 4294967296))) (or (not (< .cse32 .cse1)) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse33)) (not (< .cse33 .cse1)))) (let ((.cse34 (mod (+ 17 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse34)) (not (< .cse34 .cse1)))) (let ((.cse35 (mod (+ c_main_~x~0 1) 4294967296))) (or (not (<= 5000000 .cse35)) (not (< .cse35 .cse1)))) (let ((.cse36 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse36)) (not (< .cse36 .cse1)))) (let ((.cse37 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse37 .cse1)) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse38 .cse1)) (not (<= 5000000 .cse38)))) (not (<= 5000000 (mod c_main_~x~0 4294967296))) (let ((.cse39 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse39 .cse1)) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ 7 c_main_~x~0) 4294967296))) (or (not (< .cse40 .cse1)) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (< .cse41 .cse1)) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ c_main_~x~0 37) 4294967296))) (or (not (< .cse42 .cse1)) (not (<= 5000000 .cse42)))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse43 (mod (+ 5 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse43)) (not (< .cse43 .cse1)))) (let ((.cse44 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse44)) (not (< .cse44 .cse1)))) (let ((.cse45 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse45 .cse1)) (not (<= 5000000 .cse45)))) (let ((.cse46 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (not (< .cse46 .cse1)))))) is different from false [2022-04-27 11:29:42,509 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~y~0 4294967296))) (and (let ((.cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse0 .cse1)) (not (<= 5000000 .cse0)))) (let ((.cse2 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (not (< .cse2 .cse1)))) (let ((.cse3 (mod (+ 3 c_main_~x~0) 4294967296))) (or (not (< .cse3 .cse1)) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (<= 5000000 .cse4)) (not (< .cse4 .cse1)))) (let ((.cse5 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (not (< .cse5 .cse1)))) (let ((.cse6 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse6)) (not (< .cse6 .cse1)))) (let ((.cse7 (mod (+ 9 c_main_~x~0) 4294967296))) (or (not (< .cse7 .cse1)) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse8 .cse1)) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse9)) (not (< .cse9 .cse1)))) (let ((.cse10 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (not (< .cse10 .cse1)))) (let ((.cse11 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse11 .cse1)) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse12 .cse1)) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse13 .cse1)) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 6 c_main_~x~0) 4294967296))) (or (not (< .cse14 .cse1)) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (not (< .cse15 .cse1)))) (let ((.cse16 (mod (+ 36 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse16)) (not (< .cse16 .cse1)))) (let ((.cse17 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse17 .cse1)) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse18 .cse1)) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (< .cse19 .cse1)) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse20)) (not (< .cse20 .cse1)))) (let ((.cse21 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (not (< .cse21 .cse1)))) (let ((.cse22 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse22 .cse1)) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse23 .cse1)) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ 39 c_main_~x~0) 4294967296))) (or (not (< .cse24 .cse1)) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ 13 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse25)) (not (< .cse25 .cse1)))) (let ((.cse26 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (< .cse26 .cse1)) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ c_main_~x~0 11) 4294967296))) (or (not (< .cse27 .cse1)) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse28 .cse1)) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (not (< .cse29 .cse1)))) (let ((.cse30 (mod (+ 12 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (not (< .cse30 .cse1)))) (let ((.cse31 (mod (+ 4 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse31)) (not (< .cse31 .cse1)))) (let ((.cse32 (mod (+ 16 c_main_~x~0) 4294967296))) (or (not (< .cse32 .cse1)) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse33)) (not (< .cse33 .cse1)))) (let ((.cse34 (mod (+ 17 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse34)) (not (< .cse34 .cse1)))) (let ((.cse35 (mod (+ c_main_~x~0 1) 4294967296))) (or (not (<= 5000000 .cse35)) (not (< .cse35 .cse1)))) (let ((.cse36 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse36)) (not (< .cse36 .cse1)))) (let ((.cse37 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse37 .cse1)) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse38 .cse1)) (not (<= 5000000 .cse38)))) (not (<= 5000000 (mod c_main_~x~0 4294967296))) (let ((.cse39 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse39 .cse1)) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ 7 c_main_~x~0) 4294967296))) (or (not (< .cse40 .cse1)) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (< .cse41 .cse1)) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ c_main_~x~0 37) 4294967296))) (or (not (< .cse42 .cse1)) (not (<= 5000000 .cse42)))) (let ((.cse43 (mod (+ 5 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse43)) (not (< .cse43 .cse1)))) (let ((.cse44 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse44)) (not (< .cse44 .cse1)))) (let ((.cse45 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse45 .cse1)) (not (<= 5000000 .cse45)))) (let ((.cse46 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (not (< .cse46 .cse1)))))) is different from false