/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:34:58,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:34:58,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:34:58,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:34:58,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:34:58,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:34:58,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:34:58,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:34:59,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:34:59,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:34:59,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:34:59,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:34:59,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:34:59,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:34:59,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:34:59,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:34:59,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:34:59,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:34:59,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:34:59,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:34:59,012 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:34:59,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:34:59,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:34:59,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:34:59,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:34:59,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:34:59,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:34:59,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:34:59,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:34:59,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:34:59,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:34:59,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:34:59,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:34:59,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:34:59,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:34:59,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:34:59,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:34:59,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:34:59,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:34:59,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:34:59,023 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:34:59,024 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:34:59,025 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:34:59,032 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:34:59,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:34:59,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:34:59,034 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:34:59,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:34:59,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:34:59,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:34:59,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:34:59,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:34:59,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:34:59,035 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:34:59,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:34:59,035 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:34:59,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:34:59,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:34:59,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:34:59,036 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:34:59,036 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:34:59,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:34:59,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:34:59,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:34:59,037 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:34:59,037 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 16:34:59,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:34:59,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:34:59,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:34:59,257 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:34:59,257 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:34:59,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2022-04-27 16:34:59,307 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a2618d1/046d1f9998cd4f6089c101de4e36db38/FLAG4376d6708 [2022-04-27 16:34:59,655 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:34:59,655 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2022-04-27 16:34:59,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a2618d1/046d1f9998cd4f6089c101de4e36db38/FLAG4376d6708 [2022-04-27 16:34:59,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a2618d1/046d1f9998cd4f6089c101de4e36db38 [2022-04-27 16:34:59,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:34:59,680 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:34:59,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:34:59,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:34:59,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:34:59,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:34:59" (1/1) ... [2022-04-27 16:34:59,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bbbfa02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:34:59, skipping insertion in model container [2022-04-27 16:34:59,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:34:59" (1/1) ... [2022-04-27 16:34:59,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:34:59,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:34:59,891 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/Mono6_1.c[311,324] [2022-04-27 16:34:59,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:34:59,917 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:34:59,924 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/Mono6_1.c[311,324] [2022-04-27 16:34:59,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:34:59,937 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:34:59,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:34:59 WrapperNode [2022-04-27 16:34:59,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:34:59,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:34:59,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:34:59,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:34:59,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:34:59" (1/1) ... [2022-04-27 16:34:59,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:34:59" (1/1) ... [2022-04-27 16:34:59,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:34:59" (1/1) ... [2022-04-27 16:34:59,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:34:59" (1/1) ... [2022-04-27 16:34:59,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:34:59" (1/1) ... [2022-04-27 16:34:59,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:34:59" (1/1) ... [2022-04-27 16:34:59,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:34:59" (1/1) ... [2022-04-27 16:34:59,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:34:59,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:34:59,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:34:59,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:34:59,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:34:59" (1/1) ... [2022-04-27 16:34:59,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:34:59,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:34:59,996 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 16:35:00,005 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 16:35:00,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:35:00,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:35:00,031 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:35:00,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:35:00,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:35:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:35:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:35:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:35:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:35:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:35:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:35:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:35:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:35:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:35:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:35:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:35:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:35:00,079 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:35:00,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:35:00,219 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:35:00,224 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:35:00,224 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 16:35:00,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:35:00 BoogieIcfgContainer [2022-04-27 16:35:00,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:35:00,226 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:35:00,226 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:35:00,238 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:35:00,241 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:35:00" (1/1) ... [2022-04-27 16:35:00,243 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:35:00,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:35:00 BasicIcfg [2022-04-27 16:35:00,276 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:35:00,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:35:00,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:35:00,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:35:00,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:34:59" (1/4) ... [2022-04-27 16:35:00,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1587b6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:35:00, skipping insertion in model container [2022-04-27 16:35:00,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:34:59" (2/4) ... [2022-04-27 16:35:00,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1587b6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:35:00, skipping insertion in model container [2022-04-27 16:35:00,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:35:00" (3/4) ... [2022-04-27 16:35:00,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1587b6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:35:00, skipping insertion in model container [2022-04-27 16:35:00,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:35:00" (4/4) ... [2022-04-27 16:35:00,283 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono6_1.cJordan [2022-04-27 16:35:00,309 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:35:00,309 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:35:00,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:35:00,383 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56bebcb8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5f516180 [2022-04-27 16:35:00,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:35:00,391 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 16:35:00,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:35:00,397 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:35:00,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:35:00,398 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:35:00,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:35:00,408 INFO L85 PathProgramCache]: Analyzing trace with hash 447419557, now seen corresponding path program 1 times [2022-04-27 16:35:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:35:00,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61110501] [2022-04-27 16:35:00,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:00,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:35:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:00,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:35:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:00,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 16:35:00,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:35:00,606 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:35:00,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:35:00,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 16:35:00,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:35:00,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:35:00,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:35:00,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {24#true} is VALID [2022-04-27 16:35:00,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [53] L10-2-->L10-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:35:00,615 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {25#false} is VALID [2022-04-27 16:35:00,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-27 16:35:00,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:35:00,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:35:00,616 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 16:35:00,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:35:00,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61110501] [2022-04-27 16:35:00,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61110501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:35:00,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:35:00,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:35:00,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301483654] [2022-04-27 16:35:00,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:35:00,624 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 16:35:00,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:35:00,627 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 16:35:00,645 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 16:35:00,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:35:00,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:35:00,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:35:00,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:35:00,669 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 16:35:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:00,740 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 16:35:00,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:35:00,740 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 16:35:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:35:00,741 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 16:35:00,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-04-27 16:35:00,751 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 16:35:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-04-27 16:35:00,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-04-27 16:35:00,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:00,800 INFO L225 Difference]: With dead ends: 21 [2022-04-27 16:35:00,800 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 16:35:00,802 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 16:35:00,806 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 16:35:00,807 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 16:35:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 16:35:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 16:35:00,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:35:00,830 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 16:35:00,831 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 16:35:00,831 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 16:35:00,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:00,836 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 16:35:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 16:35:00,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:00,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:00,838 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 16:35:00,839 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 16:35:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:00,843 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 16:35:00,843 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 16:35:00,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:00,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:00,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:35:00,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:35:00,844 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 16:35:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 16:35:00,845 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-27 16:35:00,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:35:00,846 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 16:35:00,846 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 16:35:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 16:35:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:35:00,846 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:35:00,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:35:00,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:35:00,847 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:35:00,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:35:00,848 INFO L85 PathProgramCache]: Analyzing trace with hash 448343078, now seen corresponding path program 1 times [2022-04-27 16:35:00,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:35:00,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743695963] [2022-04-27 16:35:00,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:00,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:35:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:01,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:35:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:01,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {95#true} is VALID [2022-04-27 16:35:01,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:35:01,034 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95#true} {95#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:35:01,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {95#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:35:01,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {95#true} is VALID [2022-04-27 16:35:01,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {95#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:35:01,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95#true} {95#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:35:01,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {95#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:35:01,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {95#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {100#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 16:35:01,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {100#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-27 16:35:01,052 INFO L272 TraceCheckUtils]: 7: Hoare triple {96#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {96#false} is VALID [2022-04-27 16:35:01,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {96#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {96#false} is VALID [2022-04-27 16:35:01,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {96#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-27 16:35:01,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {96#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-27 16:35:01,054 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 16:35:01,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:35:01,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743695963] [2022-04-27 16:35:01,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743695963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:35:01,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:35:01,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:35:01,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644192324] [2022-04-27 16:35:01,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:35:01,057 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 16:35:01,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:35:01,058 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 16:35:01,073 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 16:35:01,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:35:01,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:35:01,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:35:01,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:35:01,079 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 16:35:01,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:01,161 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 16:35:01,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:35:01,162 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 16:35:01,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:35:01,162 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 16:35:01,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-27 16:35:01,165 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 16:35:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-27 16:35:01,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2022-04-27 16:35:01,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:01,202 INFO L225 Difference]: With dead ends: 17 [2022-04-27 16:35:01,202 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 16:35:01,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:35:01,205 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 16:35:01,205 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 16:35:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 16:35:01,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-27 16:35:01,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:35:01,210 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 16:35:01,211 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 16:35:01,211 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 16:35:01,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:01,214 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 16:35:01,214 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 16:35:01,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:01,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:01,215 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 16:35:01,215 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 16:35:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:01,217 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 16:35:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 16:35:01,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:01,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:01,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:35:01,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:35:01,219 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 16:35:01,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-27 16:35:01,221 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-27 16:35:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:35:01,222 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-27 16:35:01,222 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 16:35:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 16:35:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:35:01,222 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:35:01,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:35:01,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:35:01,223 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:35:01,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:35:01,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1516694440, now seen corresponding path program 1 times [2022-04-27 16:35:01,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:35:01,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356078522] [2022-04-27 16:35:01,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:01,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:35:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:01,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:35:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:01,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {173#true} is VALID [2022-04-27 16:35:01,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 16:35:01,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173#true} {173#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 16:35:01,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:35:01,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {173#true} is VALID [2022-04-27 16:35:01,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 16:35:01,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 16:35:01,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 16:35:01,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {178#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} is VALID [2022-04-27 16:35:01,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {178#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} is VALID [2022-04-27 16:35:01,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {178#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} is VALID [2022-04-27 16:35:01,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {179#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-27 16:35:01,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {179#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999999 main_~x~0) main_~y~0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 16:35:01,432 INFO L272 TraceCheckUtils]: 10: Hoare triple {174#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {174#false} is VALID [2022-04-27 16:35:01,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {174#false} is VALID [2022-04-27 16:35:01,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {174#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 16:35:01,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {174#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 16:35:01,433 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 16:35:01,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:35:01,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356078522] [2022-04-27 16:35:01,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356078522] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:35:01,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80537655] [2022-04-27 16:35:01,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:01,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:35:01,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:35:01,439 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 16:35:01,440 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 16:35:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:01,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 16:35:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:01,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:35:01,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 16:35:01,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {173#true} is VALID [2022-04-27 16:35:01,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 16:35:01,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 16:35:01,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 16:35:01,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {199#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:01,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {199#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {199#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:01,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {199#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:01,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {199#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {209#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:01,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {209#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {209#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:01,669 INFO L272 TraceCheckUtils]: 10: Hoare triple {209#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {216#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:35:01,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {220#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:35:01,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {220#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 16:35:01,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {174#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 16:35:01,671 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 16:35:01,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:35:01,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {174#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 16:35:01,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {220#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 16:35:01,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {220#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:35:01,828 INFO L272 TraceCheckUtils]: 10: Hoare triple {236#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {216#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:35:01,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {236#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {236#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:35:01,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {236#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:35:01,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {243#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:35:01,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {243#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {243#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:35:01,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {243#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:35:01,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 16:35:01,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 16:35:01,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 16:35:01,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {173#true} is VALID [2022-04-27 16:35:01,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 16:35:01,834 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 16:35:01,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80537655] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:35:01,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:35:01,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-04-27 16:35:01,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744922816] [2022-04-27 16:35:01,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:35:01,840 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 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 16:35:01,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:35:01,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:01,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:01,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 16:35:01,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:35:01,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 16:35:01,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:35:01,869 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:02,269 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-27 16:35:02,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 16:35:02,270 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 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 16:35:02,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:35:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 38 transitions. [2022-04-27 16:35:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 38 transitions. [2022-04-27 16:35:02,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 38 transitions. [2022-04-27 16:35:02,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:02,328 INFO L225 Difference]: With dead ends: 31 [2022-04-27 16:35:02,328 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 16:35:02,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-04-27 16:35:02,330 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:35:02,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 36 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:35:02,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 16:35:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-27 16:35:02,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:35:02,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 16:35:02,333 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 16:35:02,333 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 16:35:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:02,335 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 16:35:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 16:35:02,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:02,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:02,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 27 states. [2022-04-27 16:35:02,336 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 27 states. [2022-04-27 16:35:02,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:02,337 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 16:35:02,337 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 16:35:02,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:02,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:02,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:35:02,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:35:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 16:35:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-27 16:35:02,339 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-04-27 16:35:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:35:02,339 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-27 16:35:02,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 16:35:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 16:35:02,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:35:02,341 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:35:02,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:35:02,561 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 16:35:02,561 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:35:02,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:35:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash -691789689, now seen corresponding path program 1 times [2022-04-27 16:35:02,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:35:02,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265479140] [2022-04-27 16:35:02,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:02,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:35:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:02,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:35:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:02,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {394#true} is VALID [2022-04-27 16:35:02,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 16:35:02,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {394#true} {394#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 16:35:02,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {394#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:35:02,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {402#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {394#true} is VALID [2022-04-27 16:35:02,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 16:35:02,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {394#true} {394#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 16:35:02,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {394#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 16:35:02,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {394#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {399#(= main_~x~0 0)} is VALID [2022-04-27 16:35:02,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {399#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {399#(= main_~x~0 0)} is VALID [2022-04-27 16:35:02,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {399#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {399#(= main_~x~0 0)} is VALID [2022-04-27 16:35:02,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {399#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:35:02,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:35:02,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:35:02,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {401#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 16:35:02,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {401#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {401#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 16:35:02,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {401#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {395#false} is VALID [2022-04-27 16:35:02,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {395#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {395#false} is VALID [2022-04-27 16:35:02,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {395#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 16:35:02,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {395#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 16:35:02,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {395#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {395#false} is VALID [2022-04-27 16:35:02,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {395#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 16:35:02,708 INFO L272 TraceCheckUtils]: 19: Hoare triple {395#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {395#false} is VALID [2022-04-27 16:35:02,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {395#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {395#false} is VALID [2022-04-27 16:35:02,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {395#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 16:35:02,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {395#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 16:35:02,708 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 16:35:02,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:35:02,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265479140] [2022-04-27 16:35:02,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265479140] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:35:02,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842567343] [2022-04-27 16:35:02,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:02,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:35:02,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:35:02,710 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 16:35:02,726 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 16:35:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:02,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 16:35:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:02,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:35:03,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {394#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 16:35:03,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {394#true} is VALID [2022-04-27 16:35:03,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 16:35:03,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {394#true} {394#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 16:35:03,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {394#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 16:35:03,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {394#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {399#(= main_~x~0 0)} is VALID [2022-04-27 16:35:03,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {399#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {399#(= main_~x~0 0)} is VALID [2022-04-27 16:35:03,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {399#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {399#(= main_~x~0 0)} is VALID [2022-04-27 16:35:03,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {399#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:35:03,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:35:03,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:35:03,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {439#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:35:03,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {439#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {439#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:35:03,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {439#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {395#false} is VALID [2022-04-27 16:35:03,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {395#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {395#false} is VALID [2022-04-27 16:35:03,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {395#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 16:35:03,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {395#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 16:35:03,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {395#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {395#false} is VALID [2022-04-27 16:35:03,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {395#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 16:35:03,121 INFO L272 TraceCheckUtils]: 19: Hoare triple {395#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {395#false} is VALID [2022-04-27 16:35:03,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {395#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {395#false} is VALID [2022-04-27 16:35:03,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {395#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 16:35:03,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {395#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 16:35:03,122 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 16:35:03,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:35:03,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {395#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 16:35:03,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {395#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 16:35:03,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {395#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {395#false} is VALID [2022-04-27 16:35:03,386 INFO L272 TraceCheckUtils]: 19: Hoare triple {395#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {395#false} is VALID [2022-04-27 16:35:03,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {395#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 16:35:03,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {395#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {395#false} is VALID [2022-04-27 16:35:03,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {395#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 16:35:03,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {395#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 16:35:03,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {395#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {395#false} is VALID [2022-04-27 16:35:03,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {500#(not (<= 5000000 (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {395#false} is VALID [2022-04-27 16:35:03,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {504#(or (<= 4294967295 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod main_~x~0 4294967296))))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {500#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:35:03,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {504#(or (<= 4294967295 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 16:35:03,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {508#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {508#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:35:03,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {508#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {508#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:35:03,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {518#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {508#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:35:03,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {518#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {518#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-27 16:35:03,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {518#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {518#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-27 16:35:03,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {394#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {518#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-27 16:35:03,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {394#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 16:35:03,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {394#true} {394#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 16:35:03,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 16:35:03,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {394#true} is VALID [2022-04-27 16:35:03,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {394#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 16:35:03,397 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 16:35:03,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842567343] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:35:03,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:35:03,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-04-27 16:35:03,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76863619] [2022-04-27 16:35:03,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:35:03,398 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 16:35:03,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:35:03,399 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 16:35:03,436 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 16:35:03,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 16:35:03,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:35:03,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 16:35:03,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:35:03,438 INFO L87 Difference]: Start difference. First operand 25 states and 28 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 16:35:03,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:03,774 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 16:35:03,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 16:35:03,775 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 16:35:03,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:35:03,775 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 16:35:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-27 16:35:03,777 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 16:35:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-27 16:35:03,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2022-04-27 16:35:03,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:03,822 INFO L225 Difference]: With dead ends: 34 [2022-04-27 16:35:03,822 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 16:35:03,822 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 16:35:03,823 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:35:03,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 28 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:35:03,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 16:35:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-27 16:35:03,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:35:03,826 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 16:35:03,827 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 16:35:03,827 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 16:35:03,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:03,829 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 16:35:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-27 16:35:03,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:03,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:03,829 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 16:35:03,830 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 16:35:03,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:03,831 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 16:35:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-27 16:35:03,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:03,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:03,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:35:03,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:35:03,832 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 16:35:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-27 16:35:03,833 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2022-04-27 16:35:03,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:35:03,833 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-27 16:35:03,833 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 16:35:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 16:35:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 16:35:03,834 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:35:03,834 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:35:03,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 16:35:04,051 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 16:35:04,052 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:35:04,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:35:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash -888303194, now seen corresponding path program 2 times [2022-04-27 16:35:04,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:35:04,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920124826] [2022-04-27 16:35:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:04,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:35:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:04,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:35:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:04,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {690#true} is VALID [2022-04-27 16:35:04,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {690#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-27 16:35:04,255 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {690#true} {690#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-27 16:35:04,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {690#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:35:04,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {690#true} is VALID [2022-04-27 16:35:04,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {690#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-27 16:35:04,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {690#true} {690#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-27 16:35:04,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {690#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-27 16:35:04,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {690#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {695#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 16:35:04,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {695#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {695#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 16:35:04,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {695#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {695#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 16:35:04,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {695#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {696#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-27 16:35:04,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {696#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {696#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-27 16:35:04,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {696#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {696#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-27 16:35:04,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {696#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {697#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} is VALID [2022-04-27 16:35:04,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {697#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {697#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} is VALID [2022-04-27 16:35:04,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {697#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {697#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} is VALID [2022-04-27 16:35:04,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {697#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {698#(and (or (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= main_~y~0 (+ main_~x~0 9999997))) (<= (+ main_~x~0 9999997) main_~y~0))} is VALID [2022-04-27 16:35:04,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {698#(and (or (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= main_~y~0 (+ main_~x~0 9999997))) (<= (+ main_~x~0 9999997) main_~y~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {699#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 9999997) main_~y~0))} is VALID [2022-04-27 16:35:04,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {699#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 9999997) main_~y~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {699#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 9999997) main_~y~0))} is VALID [2022-04-27 16:35:04,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {699#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 9999997) main_~y~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {700#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999996 main_~x~0) main_~y~0))} is VALID [2022-04-27 16:35:04,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {700#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999996 main_~x~0) main_~y~0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {691#false} is VALID [2022-04-27 16:35:04,267 INFO L272 TraceCheckUtils]: 19: Hoare triple {691#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {691#false} is VALID [2022-04-27 16:35:04,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {691#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {691#false} is VALID [2022-04-27 16:35:04,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {691#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {691#false} is VALID [2022-04-27 16:35:04,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {691#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {691#false} is VALID [2022-04-27 16:35:04,268 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 16:35:04,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:35:04,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920124826] [2022-04-27 16:35:04,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920124826] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:35:04,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790069317] [2022-04-27 16:35:04,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 16:35:04,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:35:04,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:35:04,269 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 16:35:04,271 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 16:35:04,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 16:35:04,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:35:04,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 16:35:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:04,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:35:04,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {690#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-27 16:35:04,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {690#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {690#true} is VALID [2022-04-27 16:35:04,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {690#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-27 16:35:04,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {690#true} {690#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-27 16:35:04,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {690#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-27 16:35:04,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {690#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:04,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:04,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:04,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:04,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:04,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:04,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:04,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:04,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:04,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:04,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:04,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:04,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:04,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {760#(and (not (< (mod main_~x~0 4294967296) 10000000)) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:04,598 INFO L272 TraceCheckUtils]: 19: Hoare triple {760#(and (not (< (mod main_~x~0 4294967296) 10000000)) (= 5000000 main_~z~0))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {764#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:35:04,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {764#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {768#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:35:04,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {768#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {691#false} is VALID [2022-04-27 16:35:04,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {691#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {691#false} is VALID [2022-04-27 16:35:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 16:35:04,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 16:35:04,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790069317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:35:04,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 16:35:04,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-04-27 16:35:04,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136065444] [2022-04-27 16:35:04,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:35:04,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 23 [2022-04-27 16:35:04,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:35:04,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 16:35:04,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:04,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:35:04,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:35:04,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:35:04,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-04-27 16:35:04,614 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 16:35:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:04,712 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-27 16:35:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:35:04,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 23 [2022-04-27 16:35:04,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:35:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 16:35:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-27 16:35:04,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 16:35:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-27 16:35:04,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-04-27 16:35:04,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:04,740 INFO L225 Difference]: With dead ends: 37 [2022-04-27 16:35:04,740 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 16:35:04,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-27 16:35:04,741 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:35:04,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:35:04,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 16:35:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 16:35:04,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:35:04,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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 16:35:04,744 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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 16:35:04,744 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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 16:35:04,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:04,746 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 16:35:04,746 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 16:35:04,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:04,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:04,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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 16:35:04,746 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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 16:35:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:04,748 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 16:35:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 16:35:04,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:04,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:04,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:35:04,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:35:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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 16:35:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-04-27 16:35:04,749 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 23 [2022-04-27 16:35:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:35:04,750 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-04-27 16:35:04,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 16:35:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 16:35:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 16:35:04,750 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:35:04,750 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:35:04,783 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 16:35:04,975 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 16:35:04,975 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:35:04,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:35:04,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1647316777, now seen corresponding path program 2 times [2022-04-27 16:35:04,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:35:04,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525318672] [2022-04-27 16:35:04,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:04,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:35:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:05,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:35:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:05,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {917#true} is VALID [2022-04-27 16:35:05,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 16:35:05,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {917#true} {917#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 16:35:05,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:35:05,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {917#true} is VALID [2022-04-27 16:35:05,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 16:35:05,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 16:35:05,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 16:35:05,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {922#(= main_~x~0 0)} is VALID [2022-04-27 16:35:05,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {922#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {922#(= main_~x~0 0)} is VALID [2022-04-27 16:35:05,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {922#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {922#(= main_~x~0 0)} is VALID [2022-04-27 16:35:05,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {922#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {923#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:35:05,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {923#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {923#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:35:05,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {923#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {923#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:35:05,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {923#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {924#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:35:05,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {924#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {924#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:35:05,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {924#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {924#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:35:05,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {924#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {925#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:35:05,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {925#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {925#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:35:05,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {925#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {925#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:35:05,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {925#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {926#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:35:05,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {926#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {926#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:35:05,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {926#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {926#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:35:05,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {926#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {927#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:35:05,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {927#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {927#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:35:05,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {927#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {927#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:35:05,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {927#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {928#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-27 16:35:05,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {928#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {928#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-27 16:35:05,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {928#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {918#false} is VALID [2022-04-27 16:35:05,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {918#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {918#false} is VALID [2022-04-27 16:35:05,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {918#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 16:35:05,146 INFO L272 TraceCheckUtils]: 28: Hoare triple {918#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {918#false} is VALID [2022-04-27 16:35:05,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {918#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {918#false} is VALID [2022-04-27 16:35:05,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {918#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 16:35:05,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {918#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 16:35:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:35:05,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:35:05,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525318672] [2022-04-27 16:35:05,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525318672] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:35:05,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753958397] [2022-04-27 16:35:05,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 16:35:05,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:35:05,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:35:05,149 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 16:35:05,158 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 16:35:05,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 16:35:05,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:35:05,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 16:35:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:05,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:35:05,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 16:35:05,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {917#true} is VALID [2022-04-27 16:35:05,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 16:35:05,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 16:35:05,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 16:35:05,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {948#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:05,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {948#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {948#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:05,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {948#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {948#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:05,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {948#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {958#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:05,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {958#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {958#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:05,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {958#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {958#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:05,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {958#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {968#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 16:35:05,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {968#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {968#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 16:35:05,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {968#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {968#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 16:35:05,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {968#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {978#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} is VALID [2022-04-27 16:35:05,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {978#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {978#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} is VALID [2022-04-27 16:35:05,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {978#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {978#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} is VALID [2022-04-27 16:35:05,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {978#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {988#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 16:35:05,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {988#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {988#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 16:35:05,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {988#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {988#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 16:35:05,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {988#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {998#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:05,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {998#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {998#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:05,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {998#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {998#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:05,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {998#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1008#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:05,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {1008#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1008#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:05,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {1008#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1015#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 16:35:05,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {1015#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 (+ (- 1) main_~z~0)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1019#(and (= (+ main_~x~0 (- 3)) 4) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 16:35:05,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {1019#(and (= (+ main_~x~0 (- 3)) 4) (= 5000000 (+ (- 1) main_~z~0)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1019#(and (= (+ main_~x~0 (- 3)) 4) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 16:35:05,545 INFO L272 TraceCheckUtils]: 28: Hoare triple {1019#(and (= (+ main_~x~0 (- 3)) 4) (= 5000000 (+ (- 1) main_~z~0)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {1026#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:35:05,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {1026#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1030#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:35:05,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {1030#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 16:35:05,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {918#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 16:35:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:35:05,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:35:05,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {918#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 16:35:05,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {1030#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 16:35:05,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {1026#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1030#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:35:05,886 INFO L272 TraceCheckUtils]: 28: Hoare triple {1046#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {1026#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:35:05,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {1046#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1046#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:35:05,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {1053#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1046#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:35:05,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {1046#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1053#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:35:05,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {1046#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1046#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:35:05,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {1053#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1046#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:35:05,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {1053#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1053#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:35:05,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {1053#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1053#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:35:05,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {1072#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1053#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:35:05,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {1072#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1072#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:35:05,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {1072#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1072#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:35:05,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {1082#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1072#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:35:05,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {1082#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1082#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:35:05,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {1082#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1082#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:35:05,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {1092#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1082#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:35:05,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {1092#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1092#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 16:35:05,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {1092#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1092#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 16:35:05,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {1102#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1092#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 16:35:05,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {1102#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1102#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:35:05,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {1102#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1102#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:35:05,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {1112#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1102#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:35:05,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {1112#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1112#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 16:35:05,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {1112#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1112#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 16:35:05,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1112#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 16:35:05,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 16:35:05,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 16:35:05,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 16:35:05,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {917#true} is VALID [2022-04-27 16:35:05,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 16:35:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 16:35:05,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753958397] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:35:05,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:35:05,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 28 [2022-04-27 16:35:05,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13835116] [2022-04-27 16:35:05,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:35:05,908 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 16:35:05,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:35:05,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:06,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:06,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 16:35:06,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:35:06,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 16:35:06,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2022-04-27 16:35:06,002 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:13,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:35:15,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:35:17,238 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:35:19,246 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:35:21,454 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:35:24,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:24,157 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-27 16:35:24,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 16:35:24,158 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 16:35:24,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:35:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 70 transitions. [2022-04-27 16:35:24,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 70 transitions. [2022-04-27 16:35:24,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 70 transitions. [2022-04-27 16:35:27,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:27,460 INFO L225 Difference]: With dead ends: 66 [2022-04-27 16:35:27,461 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 16:35:27,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=372, Invalid=1608, Unknown=0, NotChecked=0, Total=1980 [2022-04-27 16:35:27,462 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 33 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-04-27 16:35:27,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 91 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 493 Invalid, 5 Unknown, 0 Unchecked, 11.3s Time] [2022-04-27 16:35:27,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 16:35:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-04-27 16:35:27,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:35:27,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 61 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 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 16:35:27,467 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 61 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 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 16:35:27,467 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 61 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 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 16:35:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:27,470 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-27 16:35:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-27 16:35:27,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:27,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:27,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 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 63 states. [2022-04-27 16:35:27,471 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 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 63 states. [2022-04-27 16:35:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:27,473 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-27 16:35:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-27 16:35:27,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:27,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:27,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:35:27,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:35:27,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 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 16:35:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-04-27 16:35:27,475 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 32 [2022-04-27 16:35:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:35:27,476 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-04-27 16:35:27,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 16:35:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 16:35:27,477 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:35:27,477 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:35:27,499 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 16:35:27,677 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 16:35:27,677 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:35:27,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:35:27,678 INFO L85 PathProgramCache]: Analyzing trace with hash -784123847, now seen corresponding path program 3 times [2022-04-27 16:35:27,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:35:27,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8401302] [2022-04-27 16:35:27,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:27,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:35:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:27,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:35:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:27,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {1439#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1426#true} is VALID [2022-04-27 16:35:27,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {1426#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1426#true} is VALID [2022-04-27 16:35:27,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1426#true} {1426#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1426#true} is VALID [2022-04-27 16:35:27,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {1426#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1439#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:35:27,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {1439#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1426#true} is VALID [2022-04-27 16:35:27,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {1426#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1426#true} is VALID [2022-04-27 16:35:27,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1426#true} {1426#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1426#true} is VALID [2022-04-27 16:35:27,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {1426#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1426#true} is VALID [2022-04-27 16:35:27,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {1426#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1431#(= main_~x~0 0)} is VALID [2022-04-27 16:35:27,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {1431#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1431#(= main_~x~0 0)} is VALID [2022-04-27 16:35:27,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {1431#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1431#(= main_~x~0 0)} is VALID [2022-04-27 16:35:27,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {1431#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1432#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:35:27,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {1432#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1432#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:35:27,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {1432#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1432#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:35:27,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {1432#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1433#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:35:27,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {1433#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1433#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:35:27,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {1433#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1433#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:35:27,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {1433#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1434#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:35:27,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {1434#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1434#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:35:27,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1434#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:35:27,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {1434#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1435#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:35:27,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {1435#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1435#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:35:27,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {1435#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1435#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:35:27,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {1435#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1436#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:35:27,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {1436#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1436#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:35:27,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {1436#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1436#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:35:27,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {1436#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1437#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:35:27,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {1437#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1437#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:35:27,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {1437#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1437#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:35:27,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {1437#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1438#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 16:35:27,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {1438#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1438#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 16:35:27,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {1438#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1427#false} is VALID [2022-04-27 16:35:27,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {1427#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1427#false} is VALID [2022-04-27 16:35:27,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {1427#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1427#false} is VALID [2022-04-27 16:35:27,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {1427#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1427#false} is VALID [2022-04-27 16:35:27,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {1427#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1427#false} is VALID [2022-04-27 16:35:27,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {1427#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1427#false} is VALID [2022-04-27 16:35:27,900 INFO L272 TraceCheckUtils]: 34: Hoare triple {1427#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {1427#false} is VALID [2022-04-27 16:35:27,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {1427#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1427#false} is VALID [2022-04-27 16:35:27,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {1427#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1427#false} is VALID [2022-04-27 16:35:27,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {1427#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1427#false} is VALID [2022-04-27 16:35:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 38 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 16:35:27,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:35:27,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8401302] [2022-04-27 16:35:27,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8401302] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:35:27,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584535797] [2022-04-27 16:35:27,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 16:35:27,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:35:27,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:35:27,903 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 16:35:27,937 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 16:35:27,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 16:35:27,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:35:27,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 16:35:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:27,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:35:29,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {1426#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1426#true} is VALID [2022-04-27 16:35:29,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {1426#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1426#true} is VALID [2022-04-27 16:35:29,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {1426#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1426#true} is VALID [2022-04-27 16:35:29,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1426#true} {1426#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1426#true} is VALID [2022-04-27 16:35:29,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {1426#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1426#true} is VALID [2022-04-27 16:35:29,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {1426#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {1458#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {1458#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {1458#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {1458#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {1458#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {1458#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {1458#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {1458#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {1458#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {1458#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {1458#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {1458#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {1458#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {1458#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {1458#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {1458#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {1458#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {1458#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {1458#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {1458#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {1458#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {1458#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {1458#(= main_~y~0 10000000)} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {1458#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {1458#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1458#(= main_~y~0 10000000)} is VALID [2022-04-27 16:35:29,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {1458#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1537#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 16:35:29,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {1537#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1541#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-27 16:35:29,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {1541#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1427#false} is VALID [2022-04-27 16:35:29,052 INFO L272 TraceCheckUtils]: 34: Hoare triple {1427#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {1427#false} is VALID [2022-04-27 16:35:29,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {1427#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1427#false} is VALID [2022-04-27 16:35:29,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {1427#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1427#false} is VALID [2022-04-27 16:35:29,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {1427#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1427#false} is VALID [2022-04-27 16:35:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-27 16:35:29,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 16:35:29,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584535797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:35:29,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 16:35:29,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-04-27 16:35:29,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093698404] [2022-04-27 16:35:29,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:35:29,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 16:35:29,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:35:29,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:29,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:29,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:35:29,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:35:29,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:35:29,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-27 16:35:29,074 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:29,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:29,150 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-27 16:35:29,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:35:29,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 16:35:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:35:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 16:35:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 16:35:29,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-27 16:35:29,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:29,177 INFO L225 Difference]: With dead ends: 67 [2022-04-27 16:35:29,177 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 16:35:29,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 16:35:29,178 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:35:29,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 27 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:35:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 16:35:29,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2022-04-27 16:35:29,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:35:29,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 57 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 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 16:35:29,182 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 57 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 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 16:35:29,182 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 57 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 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 16:35:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:29,186 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-27 16:35:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-04-27 16:35:29,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:29,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:29,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 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 67 states. [2022-04-27 16:35:29,186 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 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 67 states. [2022-04-27 16:35:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:29,189 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-27 16:35:29,189 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-04-27 16:35:29,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:29,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:29,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:35:29,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:35:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 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 16:35:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-04-27 16:35:29,191 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 38 [2022-04-27 16:35:29,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:35:29,191 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-04-27 16:35:29,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:29,191 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-04-27 16:35:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 16:35:29,192 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:35:29,192 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:35:29,217 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 16:35:29,407 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 16:35:29,408 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:35:29,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:35:29,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1150947292, now seen corresponding path program 4 times [2022-04-27 16:35:29,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:35:29,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909322547] [2022-04-27 16:35:29,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:29,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:35:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:29,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:35:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:29,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {1829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1816#true} is VALID [2022-04-27 16:35:29,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {1816#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1816#true} is VALID [2022-04-27 16:35:29,586 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1816#true} {1816#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1816#true} is VALID [2022-04-27 16:35:29,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {1816#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:35:29,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {1829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1816#true} is VALID [2022-04-27 16:35:29,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {1816#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1816#true} is VALID [2022-04-27 16:35:29,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1816#true} {1816#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1816#true} is VALID [2022-04-27 16:35:29,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {1816#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1816#true} is VALID [2022-04-27 16:35:29,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {1816#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1821#(= main_~x~0 0)} is VALID [2022-04-27 16:35:29,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {1821#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1821#(= main_~x~0 0)} is VALID [2022-04-27 16:35:29,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {1821#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1821#(= main_~x~0 0)} is VALID [2022-04-27 16:35:29,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {1821#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:35:29,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {1822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:35:29,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {1822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:35:29,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {1822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:35:29,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {1823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:35:29,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {1823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:35:29,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {1823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:35:29,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {1824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:35:29,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {1824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:35:29,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {1824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:35:29,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {1825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:35:29,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {1825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:35:29,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {1825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:35:29,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {1826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:35:29,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {1826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:35:29,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {1826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:35:29,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {1827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:35:29,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {1827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:35:29,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {1827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1828#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 16:35:29,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {1828#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1828#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 16:35:29,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {1828#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1817#false} is VALID [2022-04-27 16:35:29,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {1817#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1817#false} is VALID [2022-04-27 16:35:29,603 INFO L290 TraceCheckUtils]: 30: Hoare triple {1817#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1817#false} is VALID [2022-04-27 16:35:29,603 INFO L290 TraceCheckUtils]: 31: Hoare triple {1817#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1817#false} is VALID [2022-04-27 16:35:29,603 INFO L290 TraceCheckUtils]: 32: Hoare triple {1817#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1817#false} is VALID [2022-04-27 16:35:29,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {1817#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1817#false} is VALID [2022-04-27 16:35:29,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {1817#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1817#false} is VALID [2022-04-27 16:35:29,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {1817#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1817#false} is VALID [2022-04-27 16:35:29,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {1817#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1817#false} is VALID [2022-04-27 16:35:29,604 INFO L272 TraceCheckUtils]: 37: Hoare triple {1817#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {1817#false} is VALID [2022-04-27 16:35:29,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {1817#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1817#false} is VALID [2022-04-27 16:35:29,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {1817#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1817#false} is VALID [2022-04-27 16:35:29,604 INFO L290 TraceCheckUtils]: 40: Hoare triple {1817#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1817#false} is VALID [2022-04-27 16:35:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 61 proven. 77 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 16:35:29,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:35:29,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909322547] [2022-04-27 16:35:29,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909322547] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:35:29,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478692798] [2022-04-27 16:35:29,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 16:35:29,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:35:29,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:35:29,606 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 16:35:29,607 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 16:35:29,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 16:35:29,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:35:29,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-27 16:35:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:29,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:35:30,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {1816#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1816#true} is VALID [2022-04-27 16:35:30,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {1816#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1816#true} is VALID [2022-04-27 16:35:30,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {1816#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1816#true} is VALID [2022-04-27 16:35:30,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1816#true} {1816#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1816#true} is VALID [2022-04-27 16:35:30,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {1816#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1816#true} is VALID [2022-04-27 16:35:30,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {1816#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1848#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {1848#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1848#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {1848#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1848#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {1848#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1858#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {1858#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1858#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {1858#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1858#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {1858#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1868#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {1868#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1868#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {1868#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1868#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {1868#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1878#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {1878#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1878#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {1878#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1878#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {1878#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1888#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {1888#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1888#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {1888#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1888#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {1888#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1898#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 16:35:30,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {1898#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1898#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 16:35:30,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {1898#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1898#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 16:35:30,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {1898#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1908#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {1908#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1908#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {1908#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1908#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:35:30,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {1908#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1918#(and (= 5000000 main_~z~0) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 16:35:30,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {1918#(and (= 5000000 main_~z~0) (= 5 (+ (- 2) main_~x~0)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1918#(and (= 5000000 main_~z~0) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 16:35:30,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {1918#(and (= 5000000 main_~z~0) (= 5 (+ (- 2) main_~x~0)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1925#(and (= main_~z~0 5000001) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 16:35:30,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {1925#(and (= main_~z~0 5000001) (= 5 (+ (- 2) main_~x~0)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1929#(and (= main_~z~0 5000001) (= main_~x~0 8))} is VALID [2022-04-27 16:35:30,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {1929#(and (= main_~z~0 5000001) (= main_~x~0 8))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1929#(and (= main_~z~0 5000001) (= main_~x~0 8))} is VALID [2022-04-27 16:35:30,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {1929#(and (= main_~z~0 5000001) (= main_~x~0 8))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1929#(and (= main_~z~0 5000001) (= main_~x~0 8))} is VALID [2022-04-27 16:35:30,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {1929#(and (= main_~z~0 5000001) (= main_~x~0 8))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1939#(and (= (+ (- 1) main_~x~0) 8) (= main_~z~0 5000001))} is VALID [2022-04-27 16:35:30,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {1939#(and (= (+ (- 1) main_~x~0) 8) (= main_~z~0 5000001))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1939#(and (= (+ (- 1) main_~x~0) 8) (= main_~z~0 5000001))} is VALID [2022-04-27 16:35:30,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {1939#(and (= (+ (- 1) main_~x~0) 8) (= main_~z~0 5000001))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1946#(and (= (+ (- 1) main_~x~0) 8) (= 5000001 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 16:35:30,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {1946#(and (= (+ (- 1) main_~x~0) 8) (= 5000001 (+ (- 1) main_~z~0)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1950#(and (= main_~x~0 10) (= 5000001 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 16:35:30,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {1950#(and (= main_~x~0 10) (= 5000001 (+ (- 1) main_~z~0)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1950#(and (= main_~x~0 10) (= 5000001 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 16:35:30,170 INFO L272 TraceCheckUtils]: 37: Hoare triple {1950#(and (= main_~x~0 10) (= 5000001 (+ (- 1) main_~z~0)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {1957#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:35:30,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {1957#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1961#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:35:30,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {1961#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1817#false} is VALID [2022-04-27 16:35:30,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {1817#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1817#false} is VALID [2022-04-27 16:35:30,171 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 16:35:30,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:35:30,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {1817#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1817#false} is VALID [2022-04-27 16:35:30,650 INFO L290 TraceCheckUtils]: 39: Hoare triple {1961#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1817#false} is VALID [2022-04-27 16:35:30,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {1957#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1961#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:35:30,651 INFO L272 TraceCheckUtils]: 37: Hoare triple {1977#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {1957#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:35:30,651 INFO L290 TraceCheckUtils]: 36: Hoare triple {1977#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1977#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:35:30,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {1984#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1977#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:35:30,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {1977#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1984#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:35:30,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {1977#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1977#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:35:30,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {1984#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1977#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:35:30,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {1984#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1984#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:35:30,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {1984#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1984#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:35:30,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {2003#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1984#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:35:30,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {1984#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2003#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:35:30,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {1984#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1984#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:35:30,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {2003#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1984#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:35:30,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {2003#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2003#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:35:30,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {2003#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2003#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:35:30,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {2022#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2003#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:35:30,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {2022#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2022#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:35:30,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {2022#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2022#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:35:30,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {2032#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2022#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:35:30,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {2032#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2032#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 16:35:30,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {2032#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2032#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 16:35:30,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {2042#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2032#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 16:35:30,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {2042#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2042#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:35:30,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {2042#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2042#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:35:30,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {2052#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2042#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:35:30,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {2052#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2052#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 16:35:30,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {2052#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2052#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 16:35:30,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {2062#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2052#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 16:35:30,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {2062#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2062#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:35:30,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {2062#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2062#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:35:30,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {2072#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2062#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:35:30,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {2072#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2072#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 16:35:30,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {2072#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2072#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 16:35:30,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {1816#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {2072#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 16:35:30,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {1816#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1816#true} is VALID [2022-04-27 16:35:30,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1816#true} {1816#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1816#true} is VALID [2022-04-27 16:35:30,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {1816#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1816#true} is VALID [2022-04-27 16:35:30,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {1816#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1816#true} is VALID [2022-04-27 16:35:30,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {1816#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1816#true} is VALID [2022-04-27 16:35:30,698 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 16:35:30,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478692798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:35:30,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:35:30,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 13] total 35 [2022-04-27 16:35:30,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377466765] [2022-04-27 16:35:30,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:35:30,700 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 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 16:35:30,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:35:30,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:30,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:30,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-27 16:35:30,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:35:30,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-27 16:35:30,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 16:35:30,812 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:41,949 WARN L232 SmtUtils]: Spent 9.06s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 16:35:49,371 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:35:51,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:36:01,703 WARN L232 SmtUtils]: Spent 7.89s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 16:36:04,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:36:06,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:36:08,600 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:36:10,608 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:36:12,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:36:15,497 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:36:27,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:36:29,086 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:36:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:36:35,143 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2022-04-27 16:36:35,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-27 16:36:35,143 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 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 16:36:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:36:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:36:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 113 transitions. [2022-04-27 16:36:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:36:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 113 transitions. [2022-04-27 16:36:35,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 113 transitions. [2022-04-27 16:36:51,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 105 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2022-04-27 16:36:51,759 INFO L225 Difference]: With dead ends: 104 [2022-04-27 16:36:51,759 INFO L226 Difference]: Without dead ends: 97 [2022-04-27 16:36:51,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=767, Invalid=3393, Unknown=0, NotChecked=0, Total=4160 [2022-04-27 16:36:51,761 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 48 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:36:51,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 94 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 747 Invalid, 10 Unknown, 0 Unchecked, 26.2s Time] [2022-04-27 16:36:51,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-27 16:36:51,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 80. [2022-04-27 16:36:51,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:36:51,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 80 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 75 states have internal predecessors, (91), 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 16:36:51,766 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 80 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 75 states have internal predecessors, (91), 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 16:36:51,766 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 80 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 75 states have internal predecessors, (91), 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 16:36:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:36:51,768 INFO L93 Difference]: Finished difference Result 97 states and 113 transitions. [2022-04-27 16:36:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2022-04-27 16:36:51,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:36:51,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:36:51,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 75 states have internal predecessors, (91), 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 97 states. [2022-04-27 16:36:51,769 INFO L87 Difference]: Start difference. First operand has 80 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 75 states have internal predecessors, (91), 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 97 states. [2022-04-27 16:36:51,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:36:51,772 INFO L93 Difference]: Finished difference Result 97 states and 113 transitions. [2022-04-27 16:36:51,772 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2022-04-27 16:36:51,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:36:51,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:36:51,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:36:51,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:36:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 75 states have internal predecessors, (91), 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 16:36:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2022-04-27 16:36:51,774 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 41 [2022-04-27 16:36:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:36:51,774 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2022-04-27 16:36:51,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:36:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2022-04-27 16:36:51,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 16:36:51,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:36:51,775 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:36:51,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 16:36:51,991 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 16:36:51,991 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:36:51,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:36:51,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1797684346, now seen corresponding path program 5 times [2022-04-27 16:36:51,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:36:51,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500297966] [2022-04-27 16:36:51,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:36:51,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:36:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:36:52,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:36:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:36:52,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {2551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2537#true} is VALID [2022-04-27 16:36:52,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {2537#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,183 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2537#true} {2537#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {2537#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:36:52,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {2551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2537#true} is VALID [2022-04-27 16:36:52,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {2537#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {2537#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {2537#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {2542#(= main_~x~0 0)} is VALID [2022-04-27 16:36:52,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {2542#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2542#(= main_~x~0 0)} is VALID [2022-04-27 16:36:52,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {2542#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2542#(= main_~x~0 0)} is VALID [2022-04-27 16:36:52,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {2542#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2543#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:36:52,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {2543#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2543#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:36:52,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {2543#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2543#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:36:52,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {2543#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:36:52,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:36:52,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:36:52,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2545#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:36:52,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {2545#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2545#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:36:52,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {2545#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2545#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:36:52,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {2545#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2546#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:36:52,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {2546#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2546#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:36:52,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {2546#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2546#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:36:52,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {2546#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2547#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:36:52,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {2547#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2547#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:36:52,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {2547#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2547#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:36:52,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {2547#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2548#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:36:52,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {2548#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2548#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:36:52,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {2548#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2548#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:36:52,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {2548#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2549#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:36:52,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {2549#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2549#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:36:52,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {2549#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2549#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:36:52,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {2549#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2550#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 16:36:52,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {2550#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2550#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 16:36:52,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {2550#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2538#false} is VALID [2022-04-27 16:36:52,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {2538#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2538#false} is VALID [2022-04-27 16:36:52,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {2538#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:52,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {2538#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:52,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {2538#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2538#false} is VALID [2022-04-27 16:36:52,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {2538#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:52,198 INFO L290 TraceCheckUtils]: 37: Hoare triple {2538#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:52,198 INFO L290 TraceCheckUtils]: 38: Hoare triple {2538#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2538#false} is VALID [2022-04-27 16:36:52,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {2538#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:52,198 INFO L290 TraceCheckUtils]: 40: Hoare triple {2538#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2538#false} is VALID [2022-04-27 16:36:52,198 INFO L290 TraceCheckUtils]: 41: Hoare triple {2538#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2538#false} is VALID [2022-04-27 16:36:52,198 INFO L290 TraceCheckUtils]: 42: Hoare triple {2538#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:52,198 INFO L272 TraceCheckUtils]: 43: Hoare triple {2538#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {2538#false} is VALID [2022-04-27 16:36:52,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {2538#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2538#false} is VALID [2022-04-27 16:36:52,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {2538#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:52,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {2538#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 95 proven. 100 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 16:36:52,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:36:52,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500297966] [2022-04-27 16:36:52,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500297966] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:36:52,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55439038] [2022-04-27 16:36:52,199 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 16:36:52,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:36:52,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:36:52,204 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 16:36:52,207 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 16:36:52,298 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-04-27 16:36:52,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:36:52,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 16:36:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:36:52,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:36:52,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {2537#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {2537#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2537#true} is VALID [2022-04-27 16:36:52,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {2537#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {2537#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {2537#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {2537#true} is VALID [2022-04-27 16:36:52,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {2537#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {2537#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2537#true} is VALID [2022-04-27 16:36:52,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {2537#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {2537#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2537#true} is VALID [2022-04-27 16:36:52,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {2537#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {2537#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2537#true} is VALID [2022-04-27 16:36:52,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {2537#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {2537#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2537#true} is VALID [2022-04-27 16:36:52,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {2537#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {2537#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2537#true} is VALID [2022-04-27 16:36:52,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {2537#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {2537#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2537#true} is VALID [2022-04-27 16:36:52,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {2537#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {2537#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2537#true} is VALID [2022-04-27 16:36:52,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:52,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {2537#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2639#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:36:52,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {2639#(not (<= 5000000 (mod main_~x~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2643#(not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 16:36:52,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {2643#(not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2643#(not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 16:36:52,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {2643#(not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2650#(and (<= 5000000 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-27 16:36:52,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {2650#(and (<= 5000000 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2654#(and (not (<= 5000000 (mod (+ main_~x~0 4294967294) 4294967296))) (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 16:36:52,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {2654#(and (not (<= 5000000 (mod (+ main_~x~0 4294967294) 4294967296))) (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2654#(and (not (<= 5000000 (mod (+ main_~x~0 4294967294) 4294967296))) (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 16:36:52,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {2654#(and (not (<= 5000000 (mod (+ main_~x~0 4294967294) 4294967296))) (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:52,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {2538#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2538#false} is VALID [2022-04-27 16:36:52,849 INFO L290 TraceCheckUtils]: 36: Hoare triple {2538#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:52,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {2538#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:52,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {2538#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2538#false} is VALID [2022-04-27 16:36:52,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {2538#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:52,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {2538#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2538#false} is VALID [2022-04-27 16:36:52,849 INFO L290 TraceCheckUtils]: 41: Hoare triple {2538#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2538#false} is VALID [2022-04-27 16:36:52,849 INFO L290 TraceCheckUtils]: 42: Hoare triple {2538#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:52,849 INFO L272 TraceCheckUtils]: 43: Hoare triple {2538#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {2538#false} is VALID [2022-04-27 16:36:52,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {2538#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2538#false} is VALID [2022-04-27 16:36:52,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {2538#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:52,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {2538#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 123 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 16:36:52,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:36:53,066 INFO L290 TraceCheckUtils]: 46: Hoare triple {2538#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:53,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {2538#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:53,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {2538#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2538#false} is VALID [2022-04-27 16:36:53,067 INFO L272 TraceCheckUtils]: 43: Hoare triple {2538#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {2538#false} is VALID [2022-04-27 16:36:53,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {2538#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:53,067 INFO L290 TraceCheckUtils]: 41: Hoare triple {2538#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2538#false} is VALID [2022-04-27 16:36:53,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {2538#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2538#false} is VALID [2022-04-27 16:36:53,067 INFO L290 TraceCheckUtils]: 39: Hoare triple {2538#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:53,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {2538#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2538#false} is VALID [2022-04-27 16:36:53,067 INFO L290 TraceCheckUtils]: 37: Hoare triple {2538#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:53,067 INFO L290 TraceCheckUtils]: 36: Hoare triple {2538#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:53,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {2538#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2538#false} is VALID [2022-04-27 16:36:53,068 INFO L290 TraceCheckUtils]: 34: Hoare triple {2733#(<= 5000000 (mod main_~x~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2538#false} is VALID [2022-04-27 16:36:53,068 INFO L290 TraceCheckUtils]: 33: Hoare triple {2733#(<= 5000000 (mod main_~x~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2733#(<= 5000000 (mod main_~x~0 4294967296))} is VALID [2022-04-27 16:36:53,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {2740#(<= 5000000 (mod (+ main_~x~0 1) 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2733#(<= 5000000 (mod main_~x~0 4294967296))} is VALID [2022-04-27 16:36:53,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {2744#(or (not (<= 5000000 (mod main_~x~0 4294967296))) (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2740#(<= 5000000 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 16:36:53,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2744#(or (not (<= 5000000 (mod main_~x~0 4294967296))) (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:36:53,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {2537#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2537#true} is VALID [2022-04-27 16:36:53,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {2537#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {2537#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2537#true} is VALID [2022-04-27 16:36:53,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {2537#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {2537#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2537#true} is VALID [2022-04-27 16:36:53,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {2537#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {2537#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2537#true} is VALID [2022-04-27 16:36:53,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {2537#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {2537#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2537#true} is VALID [2022-04-27 16:36:53,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {2537#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {2537#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2537#true} is VALID [2022-04-27 16:36:53,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {2537#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {2537#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2537#true} is VALID [2022-04-27 16:36:53,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {2537#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {2537#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2537#true} is VALID [2022-04-27 16:36:53,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {2537#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {2537#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {2537#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {2537#true} is VALID [2022-04-27 16:36:53,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {2537#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {2537#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {2537#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2537#true} is VALID [2022-04-27 16:36:53,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {2537#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2537#true} is VALID [2022-04-27 16:36:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 110 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-04-27 16:36:53,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55439038] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:36:53,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:36:53,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 19 [2022-04-27 16:36:53,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674283762] [2022-04-27 16:36:53,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:36:53,075 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 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 47 [2022-04-27 16:36:53,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:36:53,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 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 16:36:53,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:36:53,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 16:36:53,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:36:53,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 16:36:53,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-04-27 16:36:53,189 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 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 16:36:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:36:54,133 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-04-27 16:36:54,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 16:36:54,133 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 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 47 [2022-04-27 16:36:54,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:36:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 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 16:36:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 60 transitions. [2022-04-27 16:36:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 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 16:36:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 60 transitions. [2022-04-27 16:36:54,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 60 transitions. [2022-04-27 16:36:54,213 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 16:36:54,214 INFO L225 Difference]: With dead ends: 114 [2022-04-27 16:36:54,214 INFO L226 Difference]: Without dead ends: 74 [2022-04-27 16:36:54,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 16:36:54,215 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 75 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 16:36:54,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 42 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 16:36:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-27 16:36:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2022-04-27 16:36:54,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:36:54,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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 16:36:54,219 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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 16:36:54,219 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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 16:36:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:36:54,221 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-27 16:36:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-27 16:36:54,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:36:54,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:36:54,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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 74 states. [2022-04-27 16:36:54,222 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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 74 states. [2022-04-27 16:36:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:36:54,223 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-27 16:36:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-27 16:36:54,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:36:54,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:36:54,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:36:54,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:36:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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 16:36:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-04-27 16:36:54,226 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 47 [2022-04-27 16:36:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:36:54,226 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-04-27 16:36:54,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 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 16:36:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-04-27 16:36:54,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-27 16:36:54,227 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:36:54,227 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:36:54,236 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 16:36:54,434 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 16:36:54,434 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:36:54,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:36:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash -748666459, now seen corresponding path program 6 times [2022-04-27 16:36:54,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:36:54,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678421183] [2022-04-27 16:36:54,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:36:54,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:36:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:36:54,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:36:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:36:54,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {3225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3202#true} is VALID [2022-04-27 16:36:54,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {3202#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3202#true} is VALID [2022-04-27 16:36:54,829 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3202#true} {3202#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3202#true} is VALID [2022-04-27 16:36:54,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {3202#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:36:54,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {3225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3202#true} is VALID [2022-04-27 16:36:54,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {3202#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3202#true} is VALID [2022-04-27 16:36:54,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3202#true} {3202#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3202#true} is VALID [2022-04-27 16:36:54,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {3202#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3202#true} is VALID [2022-04-27 16:36:54,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {3202#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {3207#(= main_~x~0 0)} is VALID [2022-04-27 16:36:54,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {3207#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3207#(= main_~x~0 0)} is VALID [2022-04-27 16:36:54,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {3207#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3207#(= main_~x~0 0)} is VALID [2022-04-27 16:36:54,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {3207#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:36:54,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {3208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:36:54,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {3208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:36:54,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {3208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:36:54,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {3209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:36:54,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {3209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:36:54,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {3209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:36:54,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {3210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:36:54,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {3210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:36:54,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {3210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:36:54,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {3211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:36:54,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {3211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:36:54,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {3211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:36:54,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {3212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:36:54,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {3212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:36:54,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {3212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:36:54,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {3213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:36:54,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {3213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:36:54,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {3213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3214#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:36:54,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {3214#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3214#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:36:54,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {3214#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3214#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:36:54,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {3214#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3215#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:36:54,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {3215#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3215#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:36:54,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {3215#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3215#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:36:54,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {3215#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3216#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:36:54,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {3216#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3216#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:36:54,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {3216#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3216#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:36:54,841 INFO L290 TraceCheckUtils]: 35: Hoare triple {3216#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3217#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:36:54,842 INFO L290 TraceCheckUtils]: 36: Hoare triple {3217#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3217#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:36:54,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {3217#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3217#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:36:54,842 INFO L290 TraceCheckUtils]: 38: Hoare triple {3217#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3218#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:36:54,843 INFO L290 TraceCheckUtils]: 39: Hoare triple {3218#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3218#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:36:54,843 INFO L290 TraceCheckUtils]: 40: Hoare triple {3218#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3218#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:36:54,843 INFO L290 TraceCheckUtils]: 41: Hoare triple {3218#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3219#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:36:54,844 INFO L290 TraceCheckUtils]: 42: Hoare triple {3219#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3219#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:36:54,844 INFO L290 TraceCheckUtils]: 43: Hoare triple {3219#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3219#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:36:54,844 INFO L290 TraceCheckUtils]: 44: Hoare triple {3219#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3220#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:36:54,845 INFO L290 TraceCheckUtils]: 45: Hoare triple {3220#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3220#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:36:54,845 INFO L290 TraceCheckUtils]: 46: Hoare triple {3220#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3220#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:36:54,846 INFO L290 TraceCheckUtils]: 47: Hoare triple {3220#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3221#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:36:54,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {3221#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3221#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:36:54,848 INFO L290 TraceCheckUtils]: 49: Hoare triple {3221#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3221#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:36:54,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {3221#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3222#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:36:54,849 INFO L290 TraceCheckUtils]: 51: Hoare triple {3222#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3222#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:36:54,849 INFO L290 TraceCheckUtils]: 52: Hoare triple {3222#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3222#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:36:54,850 INFO L290 TraceCheckUtils]: 53: Hoare triple {3222#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3223#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:36:54,850 INFO L290 TraceCheckUtils]: 54: Hoare triple {3223#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3223#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:36:54,850 INFO L290 TraceCheckUtils]: 55: Hoare triple {3223#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3223#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:36:54,851 INFO L290 TraceCheckUtils]: 56: Hoare triple {3223#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3224#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-27 16:36:54,851 INFO L290 TraceCheckUtils]: 57: Hoare triple {3224#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3224#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-27 16:36:54,852 INFO L290 TraceCheckUtils]: 58: Hoare triple {3224#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {3203#false} is VALID [2022-04-27 16:36:54,852 INFO L290 TraceCheckUtils]: 59: Hoare triple {3203#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3203#false} is VALID [2022-04-27 16:36:54,852 INFO L290 TraceCheckUtils]: 60: Hoare triple {3203#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3203#false} is VALID [2022-04-27 16:36:54,852 INFO L272 TraceCheckUtils]: 61: Hoare triple {3203#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {3203#false} is VALID [2022-04-27 16:36:54,852 INFO L290 TraceCheckUtils]: 62: Hoare triple {3203#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3203#false} is VALID [2022-04-27 16:36:54,852 INFO L290 TraceCheckUtils]: 63: Hoare triple {3203#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3203#false} is VALID [2022-04-27 16:36:54,852 INFO L290 TraceCheckUtils]: 64: Hoare triple {3203#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3203#false} is VALID [2022-04-27 16:36:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 35 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:36:54,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:36:54,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678421183] [2022-04-27 16:36:54,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678421183] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:36:54,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104961432] [2022-04-27 16:36:54,853 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 16:36:54,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:36:54,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:36:54,854 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 16:36:54,854 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 16:36:54,909 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-27 16:36:54,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:36:54,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 16:36:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:36:54,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:36:55,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {3202#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3202#true} is VALID [2022-04-27 16:36:55,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {3202#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3202#true} is VALID [2022-04-27 16:36:55,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {3202#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3202#true} is VALID [2022-04-27 16:36:55,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3202#true} {3202#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3202#true} is VALID [2022-04-27 16:36:55,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {3202#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3202#true} is VALID [2022-04-27 16:36:55,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {3202#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,422 INFO L290 TraceCheckUtils]: 35: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,423 INFO L290 TraceCheckUtils]: 39: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,425 INFO L290 TraceCheckUtils]: 43: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,426 INFO L290 TraceCheckUtils]: 45: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,426 INFO L290 TraceCheckUtils]: 46: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,426 INFO L290 TraceCheckUtils]: 47: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,427 INFO L290 TraceCheckUtils]: 49: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,427 INFO L290 TraceCheckUtils]: 50: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,428 INFO L290 TraceCheckUtils]: 51: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,428 INFO L290 TraceCheckUtils]: 52: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,428 INFO L290 TraceCheckUtils]: 53: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,429 INFO L290 TraceCheckUtils]: 54: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,429 INFO L290 TraceCheckUtils]: 55: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,429 INFO L290 TraceCheckUtils]: 56: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,430 INFO L290 TraceCheckUtils]: 57: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:36:55,431 INFO L290 TraceCheckUtils]: 58: Hoare triple {3244#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {3404#(and (= main_~y~0 10000000) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 16:36:55,432 INFO L290 TraceCheckUtils]: 59: Hoare triple {3404#(and (= main_~y~0 10000000) (= 5000000 (+ (- 1) main_~z~0)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3404#(and (= main_~y~0 10000000) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 16:36:55,432 INFO L290 TraceCheckUtils]: 60: Hoare triple {3404#(and (= main_~y~0 10000000) (= 5000000 (+ (- 1) main_~z~0)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3411#(and (= 5000000 (+ (- 1) main_~z~0)) (not (< (mod main_~x~0 4294967296) 10000000)))} is VALID [2022-04-27 16:36:55,433 INFO L272 TraceCheckUtils]: 61: Hoare triple {3411#(and (= 5000000 (+ (- 1) main_~z~0)) (not (< (mod main_~x~0 4294967296) 10000000)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {3415#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:36:55,434 INFO L290 TraceCheckUtils]: 62: Hoare triple {3415#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:36:55,434 INFO L290 TraceCheckUtils]: 63: Hoare triple {3419#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3203#false} is VALID [2022-04-27 16:36:55,434 INFO L290 TraceCheckUtils]: 64: Hoare triple {3203#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3203#false} is VALID [2022-04-27 16:36:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-04-27 16:36:55,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:36:56,429 INFO L290 TraceCheckUtils]: 64: Hoare triple {3203#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3203#false} is VALID [2022-04-27 16:36:56,429 INFO L290 TraceCheckUtils]: 63: Hoare triple {3419#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3203#false} is VALID [2022-04-27 16:36:56,430 INFO L290 TraceCheckUtils]: 62: Hoare triple {3415#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:36:56,431 INFO L272 TraceCheckUtils]: 61: Hoare triple {3435#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {3415#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:36:56,431 INFO L290 TraceCheckUtils]: 60: Hoare triple {3439#(< (mod main_~z~0 4294967296) (mod main_~y~0 4294967296))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3435#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:36:56,432 INFO L290 TraceCheckUtils]: 59: Hoare triple {3439#(< (mod main_~z~0 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3439#(< (mod main_~z~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,433 INFO L290 TraceCheckUtils]: 58: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {3439#(< (mod main_~z~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,433 INFO L290 TraceCheckUtils]: 57: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,433 INFO L290 TraceCheckUtils]: 56: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,434 INFO L290 TraceCheckUtils]: 55: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,434 INFO L290 TraceCheckUtils]: 54: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,434 INFO L290 TraceCheckUtils]: 53: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,435 INFO L290 TraceCheckUtils]: 52: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,435 INFO L290 TraceCheckUtils]: 51: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,436 INFO L290 TraceCheckUtils]: 50: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,436 INFO L290 TraceCheckUtils]: 49: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,436 INFO L290 TraceCheckUtils]: 48: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,437 INFO L290 TraceCheckUtils]: 47: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,437 INFO L290 TraceCheckUtils]: 46: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,437 INFO L290 TraceCheckUtils]: 45: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,438 INFO L290 TraceCheckUtils]: 44: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,438 INFO L290 TraceCheckUtils]: 43: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,438 INFO L290 TraceCheckUtils]: 42: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,439 INFO L290 TraceCheckUtils]: 41: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,439 INFO L290 TraceCheckUtils]: 40: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,439 INFO L290 TraceCheckUtils]: 39: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,440 INFO L290 TraceCheckUtils]: 36: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,441 INFO L290 TraceCheckUtils]: 35: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,442 INFO L290 TraceCheckUtils]: 32: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {3202#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {3446#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 16:36:56,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {3202#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3202#true} is VALID [2022-04-27 16:36:56,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3202#true} {3202#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3202#true} is VALID [2022-04-27 16:36:56,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {3202#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3202#true} is VALID [2022-04-27 16:36:56,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {3202#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3202#true} is VALID [2022-04-27 16:36:56,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {3202#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3202#true} is VALID [2022-04-27 16:36:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-04-27 16:36:56,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104961432] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:36:56,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:36:56,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 29 [2022-04-27 16:36:56,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494022604] [2022-04-27 16:36:56,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:36:56,457 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-27 16:36:56,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:36:56,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:36:56,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:36:56,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-27 16:36:56,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:36:56,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-27 16:36:56,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-04-27 16:36:56,531 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:36:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:36:59,351 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-04-27 16:36:59,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 16:36:59,351 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-27 16:36:59,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:36:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:36:59,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 93 transitions. [2022-04-27 16:36:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:36:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 93 transitions. [2022-04-27 16:36:59,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 93 transitions. [2022-04-27 16:36:59,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:36:59,458 INFO L225 Difference]: With dead ends: 87 [2022-04-27 16:36:59,458 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 16:36:59,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=439, Invalid=2753, Unknown=0, NotChecked=0, Total=3192 [2022-04-27 16:36:59,460 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 165 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:36:59,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 72 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 16:36:59,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 16:36:59,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-04-27 16:36:59,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:36:59,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 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 16:36:59,464 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 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 16:36:59,464 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 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 16:36:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:36:59,466 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2022-04-27 16:36:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-04-27 16:36:59,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:36:59,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:36:59,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 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 82 states. [2022-04-27 16:36:59,470 INFO L87 Difference]: Start difference. First operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 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 82 states. [2022-04-27 16:36:59,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:36:59,472 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2022-04-27 16:36:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-04-27 16:36:59,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:36:59,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:36:59,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:36:59,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:36:59,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 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 16:36:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-04-27 16:36:59,484 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 65 [2022-04-27 16:36:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:36:59,484 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-04-27 16:36:59,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:36:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-04-27 16:36:59,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 16:36:59,486 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:36:59,486 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 18, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:36:59,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 16:36:59,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 16:36:59,707 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:36:59,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:36:59,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1474088538, now seen corresponding path program 7 times [2022-04-27 16:36:59,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:36:59,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058306421] [2022-04-27 16:36:59,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:36:59,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:36:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:37:00,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:37:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:37:00,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {4032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4008#true} is VALID [2022-04-27 16:37:00,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {4008#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4008#true} is VALID [2022-04-27 16:37:00,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4008#true} {4008#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4008#true} is VALID [2022-04-27 16:37:00,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {4008#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:37:00,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {4032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4008#true} is VALID [2022-04-27 16:37:00,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {4008#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4008#true} is VALID [2022-04-27 16:37:00,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4008#true} {4008#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4008#true} is VALID [2022-04-27 16:37:00,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {4008#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4008#true} is VALID [2022-04-27 16:37:00,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {4008#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {4013#(= main_~x~0 0)} is VALID [2022-04-27 16:37:00,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {4013#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4013#(= main_~x~0 0)} is VALID [2022-04-27 16:37:00,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {4013#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4013#(= main_~x~0 0)} is VALID [2022-04-27 16:37:00,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {4013#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4014#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:37:00,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {4014#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4014#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:37:00,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {4014#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4014#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:37:00,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {4014#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4015#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:37:00,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {4015#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4015#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:37:00,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {4015#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4015#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:37:00,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {4015#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4016#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:37:00,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {4016#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4016#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:37:00,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {4016#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4016#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:37:00,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {4016#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4017#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:37:00,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {4017#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4017#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:37:00,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {4017#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4017#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:37:00,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {4017#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4018#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:37:00,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {4018#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4018#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:37:00,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {4018#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4018#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:37:00,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {4018#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4019#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:37:00,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {4019#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4019#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:37:00,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {4019#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4019#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:37:00,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {4019#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4020#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:37:00,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {4020#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4020#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:37:00,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {4020#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4020#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:37:00,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {4020#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4021#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:37:00,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {4021#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4021#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:37:00,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {4021#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4021#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:37:00,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {4021#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4022#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:37:00,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {4022#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4022#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:37:00,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {4022#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4022#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:37:00,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {4022#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4023#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:37:00,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {4023#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4023#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:37:00,169 INFO L290 TraceCheckUtils]: 37: Hoare triple {4023#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4023#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:37:00,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {4023#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4024#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:37:00,170 INFO L290 TraceCheckUtils]: 39: Hoare triple {4024#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4024#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:37:00,170 INFO L290 TraceCheckUtils]: 40: Hoare triple {4024#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4024#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:37:00,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {4024#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4025#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:37:00,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {4025#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4025#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:37:00,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {4025#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4025#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:37:00,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {4025#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4026#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:37:00,173 INFO L290 TraceCheckUtils]: 45: Hoare triple {4026#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4026#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:37:00,173 INFO L290 TraceCheckUtils]: 46: Hoare triple {4026#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4026#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:37:00,174 INFO L290 TraceCheckUtils]: 47: Hoare triple {4026#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4027#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:37:00,174 INFO L290 TraceCheckUtils]: 48: Hoare triple {4027#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4027#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:37:00,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {4027#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4027#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:37:00,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {4027#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4028#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:37:00,176 INFO L290 TraceCheckUtils]: 51: Hoare triple {4028#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4028#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:37:00,176 INFO L290 TraceCheckUtils]: 52: Hoare triple {4028#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4028#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:37:00,177 INFO L290 TraceCheckUtils]: 53: Hoare triple {4028#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4029#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:37:00,177 INFO L290 TraceCheckUtils]: 54: Hoare triple {4029#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4029#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:37:00,178 INFO L290 TraceCheckUtils]: 55: Hoare triple {4029#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4029#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:37:00,178 INFO L290 TraceCheckUtils]: 56: Hoare triple {4029#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4030#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 16:37:00,179 INFO L290 TraceCheckUtils]: 57: Hoare triple {4030#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4030#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 16:37:00,179 INFO L290 TraceCheckUtils]: 58: Hoare triple {4030#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4030#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 16:37:00,180 INFO L290 TraceCheckUtils]: 59: Hoare triple {4030#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4031#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 16:37:00,180 INFO L290 TraceCheckUtils]: 60: Hoare triple {4031#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4031#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 16:37:00,181 INFO L290 TraceCheckUtils]: 61: Hoare triple {4031#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4009#false} is VALID [2022-04-27 16:37:00,181 INFO L290 TraceCheckUtils]: 62: Hoare triple {4009#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4009#false} is VALID [2022-04-27 16:37:00,181 INFO L290 TraceCheckUtils]: 63: Hoare triple {4009#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4009#false} is VALID [2022-04-27 16:37:00,181 INFO L290 TraceCheckUtils]: 64: Hoare triple {4009#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4009#false} is VALID [2022-04-27 16:37:00,181 INFO L290 TraceCheckUtils]: 65: Hoare triple {4009#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4009#false} is VALID [2022-04-27 16:37:00,181 INFO L290 TraceCheckUtils]: 66: Hoare triple {4009#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4009#false} is VALID [2022-04-27 16:37:00,182 INFO L290 TraceCheckUtils]: 67: Hoare triple {4009#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4009#false} is VALID [2022-04-27 16:37:00,182 INFO L290 TraceCheckUtils]: 68: Hoare triple {4009#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4009#false} is VALID [2022-04-27 16:37:00,182 INFO L290 TraceCheckUtils]: 69: Hoare triple {4009#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4009#false} is VALID [2022-04-27 16:37:00,182 INFO L290 TraceCheckUtils]: 70: Hoare triple {4009#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4009#false} is VALID [2022-04-27 16:37:00,182 INFO L290 TraceCheckUtils]: 71: Hoare triple {4009#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4009#false} is VALID [2022-04-27 16:37:00,182 INFO L290 TraceCheckUtils]: 72: Hoare triple {4009#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4009#false} is VALID [2022-04-27 16:37:00,182 INFO L272 TraceCheckUtils]: 73: Hoare triple {4009#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {4009#false} is VALID [2022-04-27 16:37:00,182 INFO L290 TraceCheckUtils]: 74: Hoare triple {4009#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4009#false} is VALID [2022-04-27 16:37:00,182 INFO L290 TraceCheckUtils]: 75: Hoare triple {4009#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4009#false} is VALID [2022-04-27 16:37:00,183 INFO L290 TraceCheckUtils]: 76: Hoare triple {4009#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4009#false} is VALID [2022-04-27 16:37:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 205 proven. 495 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 16:37:00,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:37:00,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058306421] [2022-04-27 16:37:00,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058306421] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:37:00,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222623475] [2022-04-27 16:37:00,184 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 16:37:00,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:37:00,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:37:00,188 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:37:00,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 16:37:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:37:00,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-27 16:37:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:37:00,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:37:00,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {4008#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4008#true} is VALID [2022-04-27 16:37:00,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {4008#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4008#true} is VALID [2022-04-27 16:37:00,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {4008#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4008#true} is VALID [2022-04-27 16:37:00,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4008#true} {4008#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4008#true} is VALID [2022-04-27 16:37:00,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {4008#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4008#true} is VALID [2022-04-27 16:37:00,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {4008#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {4013#(= main_~x~0 0)} is VALID [2022-04-27 16:37:00,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {4013#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4013#(= main_~x~0 0)} is VALID [2022-04-27 16:37:00,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {4013#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4013#(= main_~x~0 0)} is VALID [2022-04-27 16:37:00,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {4013#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4014#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:37:00,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {4014#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4014#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:37:00,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {4014#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4014#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:37:00,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {4014#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4015#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:37:00,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {4015#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4015#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:37:00,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {4015#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4015#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:37:00,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {4015#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4016#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:37:00,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {4016#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4016#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:37:00,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {4016#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4016#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:37:00,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {4016#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4017#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:37:00,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {4017#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4017#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:37:00,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {4017#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4017#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:37:00,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {4017#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4018#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:37:00,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {4018#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4018#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:37:00,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {4018#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4018#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:37:00,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {4018#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4019#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:37:00,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {4019#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4019#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:37:00,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {4019#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4019#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:37:00,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {4019#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4020#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:37:00,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {4020#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4020#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:37:00,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {4020#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4020#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:37:00,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {4020#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4021#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:37:00,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {4021#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4021#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:37:00,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {4021#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4021#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:37:00,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {4021#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4022#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:37:00,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {4022#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4022#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:37:00,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {4022#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4022#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:37:00,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {4022#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4023#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:37:00,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {4023#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4023#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:37:00,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {4023#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4023#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:37:00,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {4023#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4024#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:37:00,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {4024#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4024#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:37:00,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {4024#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4024#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:37:00,926 INFO L290 TraceCheckUtils]: 41: Hoare triple {4024#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4025#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:37:00,926 INFO L290 TraceCheckUtils]: 42: Hoare triple {4025#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4025#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:37:00,926 INFO L290 TraceCheckUtils]: 43: Hoare triple {4025#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4025#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:37:00,931 INFO L290 TraceCheckUtils]: 44: Hoare triple {4025#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4026#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:37:00,931 INFO L290 TraceCheckUtils]: 45: Hoare triple {4026#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4026#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:37:00,932 INFO L290 TraceCheckUtils]: 46: Hoare triple {4026#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4026#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:37:00,932 INFO L290 TraceCheckUtils]: 47: Hoare triple {4026#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4027#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:37:00,933 INFO L290 TraceCheckUtils]: 48: Hoare triple {4027#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4027#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:37:00,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {4027#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4027#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:37:00,934 INFO L290 TraceCheckUtils]: 50: Hoare triple {4027#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4028#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:37:00,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {4028#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4028#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:37:00,935 INFO L290 TraceCheckUtils]: 52: Hoare triple {4028#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4028#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:37:00,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {4028#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4029#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:37:00,936 INFO L290 TraceCheckUtils]: 54: Hoare triple {4029#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4029#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:37:00,936 INFO L290 TraceCheckUtils]: 55: Hoare triple {4029#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4029#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:37:00,937 INFO L290 TraceCheckUtils]: 56: Hoare triple {4029#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4030#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 16:37:00,938 INFO L290 TraceCheckUtils]: 57: Hoare triple {4030#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4030#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 16:37:00,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {4030#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4030#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 16:37:00,939 INFO L290 TraceCheckUtils]: 59: Hoare triple {4030#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4213#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 16:37:00,939 INFO L290 TraceCheckUtils]: 60: Hoare triple {4213#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4213#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 16:37:00,940 INFO L290 TraceCheckUtils]: 61: Hoare triple {4213#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4213#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 16:37:00,940 INFO L290 TraceCheckUtils]: 62: Hoare triple {4213#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4223#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 16:37:00,941 INFO L290 TraceCheckUtils]: 63: Hoare triple {4223#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4223#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 16:37:00,941 INFO L290 TraceCheckUtils]: 64: Hoare triple {4223#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4009#false} is VALID [2022-04-27 16:37:00,941 INFO L290 TraceCheckUtils]: 65: Hoare triple {4009#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4009#false} is VALID [2022-04-27 16:37:00,941 INFO L290 TraceCheckUtils]: 66: Hoare triple {4009#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4009#false} is VALID [2022-04-27 16:37:00,941 INFO L290 TraceCheckUtils]: 67: Hoare triple {4009#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4009#false} is VALID [2022-04-27 16:37:00,942 INFO L290 TraceCheckUtils]: 68: Hoare triple {4009#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4009#false} is VALID [2022-04-27 16:37:00,942 INFO L290 TraceCheckUtils]: 69: Hoare triple {4009#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4009#false} is VALID [2022-04-27 16:37:00,942 INFO L290 TraceCheckUtils]: 70: Hoare triple {4009#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4009#false} is VALID [2022-04-27 16:37:00,942 INFO L290 TraceCheckUtils]: 71: Hoare triple {4009#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4009#false} is VALID [2022-04-27 16:37:00,942 INFO L290 TraceCheckUtils]: 72: Hoare triple {4009#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4009#false} is VALID [2022-04-27 16:37:00,942 INFO L272 TraceCheckUtils]: 73: Hoare triple {4009#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {4009#false} is VALID [2022-04-27 16:37:00,942 INFO L290 TraceCheckUtils]: 74: Hoare triple {4009#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4009#false} is VALID [2022-04-27 16:37:00,942 INFO L290 TraceCheckUtils]: 75: Hoare triple {4009#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4009#false} is VALID [2022-04-27 16:37:00,942 INFO L290 TraceCheckUtils]: 76: Hoare triple {4009#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4009#false} is VALID [2022-04-27 16:37:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 157 proven. 551 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 16:37:00,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:37:01,956 INFO L290 TraceCheckUtils]: 76: Hoare triple {4009#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4009#false} is VALID [2022-04-27 16:37:01,957 INFO L290 TraceCheckUtils]: 75: Hoare triple {4009#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4009#false} is VALID [2022-04-27 16:37:01,957 INFO L290 TraceCheckUtils]: 74: Hoare triple {4009#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4009#false} is VALID [2022-04-27 16:37:01,957 INFO L272 TraceCheckUtils]: 73: Hoare triple {4009#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {4009#false} is VALID [2022-04-27 16:37:01,957 INFO L290 TraceCheckUtils]: 72: Hoare triple {4009#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4009#false} is VALID [2022-04-27 16:37:01,957 INFO L290 TraceCheckUtils]: 71: Hoare triple {4009#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4009#false} is VALID [2022-04-27 16:37:01,957 INFO L290 TraceCheckUtils]: 70: Hoare triple {4009#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4009#false} is VALID [2022-04-27 16:37:01,957 INFO L290 TraceCheckUtils]: 69: Hoare triple {4009#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4009#false} is VALID [2022-04-27 16:37:01,957 INFO L290 TraceCheckUtils]: 68: Hoare triple {4009#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4009#false} is VALID [2022-04-27 16:37:01,957 INFO L290 TraceCheckUtils]: 67: Hoare triple {4009#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4009#false} is VALID [2022-04-27 16:37:01,957 INFO L290 TraceCheckUtils]: 66: Hoare triple {4009#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4009#false} is VALID [2022-04-27 16:37:01,958 INFO L290 TraceCheckUtils]: 65: Hoare triple {4009#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4009#false} is VALID [2022-04-27 16:37:01,959 INFO L290 TraceCheckUtils]: 64: Hoare triple {4302#(not (<= 5000000 (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4009#false} is VALID [2022-04-27 16:37:01,959 INFO L290 TraceCheckUtils]: 63: Hoare triple {4302#(not (<= 5000000 (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4302#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:37:01,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {4309#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4302#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:37:01,961 INFO L290 TraceCheckUtils]: 61: Hoare triple {4309#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4309#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:37:01,962 INFO L290 TraceCheckUtils]: 60: Hoare triple {4309#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4309#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:37:01,963 INFO L290 TraceCheckUtils]: 59: Hoare triple {4319#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4309#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:37:01,963 INFO L290 TraceCheckUtils]: 58: Hoare triple {4319#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4319#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 16:37:01,963 INFO L290 TraceCheckUtils]: 57: Hoare triple {4319#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4319#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 16:37:01,964 INFO L290 TraceCheckUtils]: 56: Hoare triple {4329#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4319#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 16:37:01,964 INFO L290 TraceCheckUtils]: 55: Hoare triple {4329#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4329#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-27 16:37:01,965 INFO L290 TraceCheckUtils]: 54: Hoare triple {4329#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4329#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-27 16:37:01,965 INFO L290 TraceCheckUtils]: 53: Hoare triple {4339#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4329#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-27 16:37:01,965 INFO L290 TraceCheckUtils]: 52: Hoare triple {4339#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4339#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 16:37:01,966 INFO L290 TraceCheckUtils]: 51: Hoare triple {4339#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4339#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 16:37:01,966 INFO L290 TraceCheckUtils]: 50: Hoare triple {4349#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4339#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 16:37:01,967 INFO L290 TraceCheckUtils]: 49: Hoare triple {4349#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4349#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:37:01,967 INFO L290 TraceCheckUtils]: 48: Hoare triple {4349#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4349#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:37:01,967 INFO L290 TraceCheckUtils]: 47: Hoare triple {4359#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4349#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:37:01,968 INFO L290 TraceCheckUtils]: 46: Hoare triple {4359#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4359#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 16:37:01,968 INFO L290 TraceCheckUtils]: 45: Hoare triple {4359#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4359#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 16:37:01,969 INFO L290 TraceCheckUtils]: 44: Hoare triple {4369#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4359#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 16:37:01,969 INFO L290 TraceCheckUtils]: 43: Hoare triple {4369#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4369#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:37:01,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {4369#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4369#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:37:01,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {4379#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4369#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:37:01,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {4379#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4379#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 16:37:01,971 INFO L290 TraceCheckUtils]: 39: Hoare triple {4379#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4379#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 16:37:01,971 INFO L290 TraceCheckUtils]: 38: Hoare triple {4389#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4379#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 16:37:01,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {4389#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4389#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 16:37:01,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {4389#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4389#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 16:37:01,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {4399#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4389#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 16:37:01,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {4399#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4399#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-27 16:37:01,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {4399#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4399#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-27 16:37:01,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {4409#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4399#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-27 16:37:01,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {4409#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4409#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-27 16:37:01,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {4409#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4409#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-27 16:37:01,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {4419#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4409#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-27 16:37:01,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {4419#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4419#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 16:37:01,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {4419#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4419#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 16:37:01,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {4429#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4419#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 16:37:01,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {4429#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4429#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 16:37:01,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {4429#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4429#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 16:37:01,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {4439#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4429#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 16:37:01,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {4439#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4439#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} is VALID [2022-04-27 16:37:01,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {4439#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4439#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} is VALID [2022-04-27 16:37:01,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {4449#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4439#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} is VALID [2022-04-27 16:37:01,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {4449#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4449#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 16:37:01,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {4449#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4449#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 16:37:01,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {4459#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4449#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 16:37:01,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {4459#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4459#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-27 16:37:01,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {4459#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4459#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-27 16:37:01,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {4469#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4459#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-27 16:37:01,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {4469#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4469#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 16:37:01,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {4469#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4469#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 16:37:01,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {4479#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4469#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 16:37:01,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {4479#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4479#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-27 16:37:01,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {4479#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4479#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-27 16:37:01,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {4489#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4479#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-27 16:37:01,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {4489#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4489#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:37:01,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {4489#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4489#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:37:01,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {4008#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {4489#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:37:01,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {4008#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4008#true} is VALID [2022-04-27 16:37:01,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4008#true} {4008#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4008#true} is VALID [2022-04-27 16:37:01,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {4008#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4008#true} is VALID [2022-04-27 16:37:01,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {4008#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4008#true} is VALID [2022-04-27 16:37:01,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {4008#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4008#true} is VALID [2022-04-27 16:37:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 157 proven. 551 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 16:37:01,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222623475] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:37:01,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:37:01,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2022-04-27 16:37:01,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944951800] [2022-04-27 16:37:01,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:37:01,994 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 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 77 [2022-04-27 16:37:01,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:37:01,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 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 16:37:02,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:37:02,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-27 16:37:02,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:37:02,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-27 16:37:02,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=1368, Unknown=0, NotChecked=0, Total=1892 [2022-04-27 16:37:02,095 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 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 16:38:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:38:08,201 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-04-27 16:38:08,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-27 16:38:08,201 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 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 77 [2022-04-27 16:38:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:38:08,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 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 16:38:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 157 transitions. [2022-04-27 16:38:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 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 16:38:08,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 157 transitions. [2022-04-27 16:38:08,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 157 transitions. [2022-04-27 16:38:08,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:38:08,425 INFO L225 Difference]: With dead ends: 144 [2022-04-27 16:38:08,425 INFO L226 Difference]: Without dead ends: 144 [2022-04-27 16:38:08,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 64.8s TimeCoverageRelationStatistics Valid=1882, Invalid=5089, Unknown=1, NotChecked=0, Total=6972 [2022-04-27 16:38:08,427 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 149 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:38:08,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 119 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 16:38:08,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-27 16:38:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-04-27 16:38:08,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:38:08,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 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 16:38:08,433 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 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 16:38:08,434 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 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 16:38:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:38:08,436 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-04-27 16:38:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-04-27 16:38:08,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:38:08,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:38:08,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 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 144 states. [2022-04-27 16:38:08,437 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 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 144 states. [2022-04-27 16:38:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:38:08,440 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-04-27 16:38:08,440 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-04-27 16:38:08,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:38:08,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:38:08,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:38:08,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:38:08,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 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 16:38:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2022-04-27 16:38:08,443 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 77 [2022-04-27 16:38:08,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:38:08,443 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2022-04-27 16:38:08,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 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 16:38:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-04-27 16:38:08,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-27 16:38:08,444 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:38:08,445 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 40, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:38:08,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-27 16:38:08,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:38:08,652 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:38:08,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:38:08,652 INFO L85 PathProgramCache]: Analyzing trace with hash 439564262, now seen corresponding path program 8 times [2022-04-27 16:38:08,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:38:08,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187651932] [2022-04-27 16:38:08,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:38:08,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:38:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:38:09,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:38:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:38:09,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {5218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5172#true} is VALID [2022-04-27 16:38:09,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {5172#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5172#true} is VALID [2022-04-27 16:38:09,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5172#true} {5172#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5172#true} is VALID [2022-04-27 16:38:09,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {5172#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:38:09,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {5218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5172#true} is VALID [2022-04-27 16:38:09,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {5172#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5172#true} is VALID [2022-04-27 16:38:09,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5172#true} {5172#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5172#true} is VALID [2022-04-27 16:38:09,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {5172#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5172#true} is VALID [2022-04-27 16:38:09,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {5172#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {5177#(= main_~x~0 0)} is VALID [2022-04-27 16:38:09,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {5177#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5177#(= main_~x~0 0)} is VALID [2022-04-27 16:38:09,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {5177#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5177#(= main_~x~0 0)} is VALID [2022-04-27 16:38:09,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {5177#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5178#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:38:09,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {5178#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5178#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:38:09,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {5178#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5178#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:38:09,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {5178#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5179#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:38:09,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {5179#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5179#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:38:09,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {5179#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5179#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:38:09,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {5179#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5180#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:38:09,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {5180#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5180#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:38:09,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {5180#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5180#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:38:09,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {5180#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5181#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:38:09,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {5181#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5181#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:38:09,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {5181#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5181#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:38:09,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {5181#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5182#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:38:09,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {5182#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5182#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:38:09,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {5182#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5182#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:38:09,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {5182#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5183#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:38:09,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {5183#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5183#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:38:09,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {5183#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5183#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:38:09,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {5183#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5184#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:38:09,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {5184#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5184#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:38:09,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {5184#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5184#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:38:09,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {5184#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5185#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:38:09,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {5185#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5185#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:38:09,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {5185#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5185#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:38:09,843 INFO L290 TraceCheckUtils]: 32: Hoare triple {5185#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5186#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:38:09,843 INFO L290 TraceCheckUtils]: 33: Hoare triple {5186#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5186#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:38:09,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {5186#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5186#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:38:09,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {5186#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5187#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:38:09,845 INFO L290 TraceCheckUtils]: 36: Hoare triple {5187#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5187#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:38:09,845 INFO L290 TraceCheckUtils]: 37: Hoare triple {5187#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5187#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:38:09,845 INFO L290 TraceCheckUtils]: 38: Hoare triple {5187#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5188#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:38:09,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {5188#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5188#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:38:09,848 INFO L290 TraceCheckUtils]: 40: Hoare triple {5188#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5188#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:38:09,848 INFO L290 TraceCheckUtils]: 41: Hoare triple {5188#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5189#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:38:09,849 INFO L290 TraceCheckUtils]: 42: Hoare triple {5189#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5189#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:38:09,849 INFO L290 TraceCheckUtils]: 43: Hoare triple {5189#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5189#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:38:09,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {5189#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5190#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:38:09,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {5190#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5190#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:38:09,851 INFO L290 TraceCheckUtils]: 46: Hoare triple {5190#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5190#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:38:09,851 INFO L290 TraceCheckUtils]: 47: Hoare triple {5190#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5191#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:38:09,852 INFO L290 TraceCheckUtils]: 48: Hoare triple {5191#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5191#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:38:09,852 INFO L290 TraceCheckUtils]: 49: Hoare triple {5191#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5191#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:38:09,853 INFO L290 TraceCheckUtils]: 50: Hoare triple {5191#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5192#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:38:09,853 INFO L290 TraceCheckUtils]: 51: Hoare triple {5192#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5192#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:38:09,854 INFO L290 TraceCheckUtils]: 52: Hoare triple {5192#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5192#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:38:09,854 INFO L290 TraceCheckUtils]: 53: Hoare triple {5192#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5193#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:38:09,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {5193#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5193#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:38:09,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {5193#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5193#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:38:09,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {5193#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5194#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 16:38:09,856 INFO L290 TraceCheckUtils]: 57: Hoare triple {5194#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5194#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 16:38:09,857 INFO L290 TraceCheckUtils]: 58: Hoare triple {5194#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5194#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 16:38:09,857 INFO L290 TraceCheckUtils]: 59: Hoare triple {5194#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5195#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 16:38:09,858 INFO L290 TraceCheckUtils]: 60: Hoare triple {5195#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5195#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 16:38:09,858 INFO L290 TraceCheckUtils]: 61: Hoare triple {5195#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5195#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 16:38:09,859 INFO L290 TraceCheckUtils]: 62: Hoare triple {5195#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5196#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 16:38:09,859 INFO L290 TraceCheckUtils]: 63: Hoare triple {5196#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5196#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 16:38:09,860 INFO L290 TraceCheckUtils]: 64: Hoare triple {5196#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5196#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 16:38:09,860 INFO L290 TraceCheckUtils]: 65: Hoare triple {5196#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5197#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 16:38:09,861 INFO L290 TraceCheckUtils]: 66: Hoare triple {5197#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5197#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 16:38:09,861 INFO L290 TraceCheckUtils]: 67: Hoare triple {5197#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5197#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 16:38:09,862 INFO L290 TraceCheckUtils]: 68: Hoare triple {5197#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5198#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 16:38:09,862 INFO L290 TraceCheckUtils]: 69: Hoare triple {5198#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5198#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 16:38:09,863 INFO L290 TraceCheckUtils]: 70: Hoare triple {5198#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5198#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 16:38:09,863 INFO L290 TraceCheckUtils]: 71: Hoare triple {5198#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5199#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 16:38:09,864 INFO L290 TraceCheckUtils]: 72: Hoare triple {5199#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5199#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 16:38:09,864 INFO L290 TraceCheckUtils]: 73: Hoare triple {5199#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5199#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 16:38:09,865 INFO L290 TraceCheckUtils]: 74: Hoare triple {5199#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5200#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 16:38:09,865 INFO L290 TraceCheckUtils]: 75: Hoare triple {5200#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5200#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 16:38:09,866 INFO L290 TraceCheckUtils]: 76: Hoare triple {5200#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5200#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 16:38:09,866 INFO L290 TraceCheckUtils]: 77: Hoare triple {5200#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5201#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 16:38:09,867 INFO L290 TraceCheckUtils]: 78: Hoare triple {5201#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5201#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 16:38:09,867 INFO L290 TraceCheckUtils]: 79: Hoare triple {5201#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5201#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 16:38:09,868 INFO L290 TraceCheckUtils]: 80: Hoare triple {5201#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5202#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 16:38:09,868 INFO L290 TraceCheckUtils]: 81: Hoare triple {5202#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5202#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 16:38:09,869 INFO L290 TraceCheckUtils]: 82: Hoare triple {5202#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5202#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 16:38:09,869 INFO L290 TraceCheckUtils]: 83: Hoare triple {5202#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5203#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 16:38:09,870 INFO L290 TraceCheckUtils]: 84: Hoare triple {5203#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5203#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 16:38:09,870 INFO L290 TraceCheckUtils]: 85: Hoare triple {5203#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5203#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 16:38:09,871 INFO L290 TraceCheckUtils]: 86: Hoare triple {5203#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5204#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 16:38:09,871 INFO L290 TraceCheckUtils]: 87: Hoare triple {5204#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5204#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 16:38:09,872 INFO L290 TraceCheckUtils]: 88: Hoare triple {5204#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5204#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 16:38:09,872 INFO L290 TraceCheckUtils]: 89: Hoare triple {5204#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5205#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 16:38:09,873 INFO L290 TraceCheckUtils]: 90: Hoare triple {5205#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5205#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 16:38:09,873 INFO L290 TraceCheckUtils]: 91: Hoare triple {5205#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5205#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 16:38:09,874 INFO L290 TraceCheckUtils]: 92: Hoare triple {5205#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5206#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 16:38:09,874 INFO L290 TraceCheckUtils]: 93: Hoare triple {5206#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5206#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 16:38:09,875 INFO L290 TraceCheckUtils]: 94: Hoare triple {5206#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5206#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 16:38:09,875 INFO L290 TraceCheckUtils]: 95: Hoare triple {5206#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5207#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 16:38:09,876 INFO L290 TraceCheckUtils]: 96: Hoare triple {5207#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5207#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 16:38:09,876 INFO L290 TraceCheckUtils]: 97: Hoare triple {5207#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5207#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 16:38:09,877 INFO L290 TraceCheckUtils]: 98: Hoare triple {5207#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5208#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 16:38:09,877 INFO L290 TraceCheckUtils]: 99: Hoare triple {5208#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5208#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 16:38:09,878 INFO L290 TraceCheckUtils]: 100: Hoare triple {5208#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5208#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 16:38:09,878 INFO L290 TraceCheckUtils]: 101: Hoare triple {5208#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5209#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 16:38:09,879 INFO L290 TraceCheckUtils]: 102: Hoare triple {5209#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5209#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 16:38:09,879 INFO L290 TraceCheckUtils]: 103: Hoare triple {5209#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5209#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 16:38:09,880 INFO L290 TraceCheckUtils]: 104: Hoare triple {5209#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5210#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 16:38:09,880 INFO L290 TraceCheckUtils]: 105: Hoare triple {5210#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5210#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 16:38:09,881 INFO L290 TraceCheckUtils]: 106: Hoare triple {5210#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5210#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 16:38:09,881 INFO L290 TraceCheckUtils]: 107: Hoare triple {5210#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5211#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 16:38:09,882 INFO L290 TraceCheckUtils]: 108: Hoare triple {5211#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5211#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 16:38:09,882 INFO L290 TraceCheckUtils]: 109: Hoare triple {5211#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5211#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 16:38:09,883 INFO L290 TraceCheckUtils]: 110: Hoare triple {5211#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5212#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 16:38:09,883 INFO L290 TraceCheckUtils]: 111: Hoare triple {5212#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5212#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 16:38:09,883 INFO L290 TraceCheckUtils]: 112: Hoare triple {5212#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5212#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 16:38:09,884 INFO L290 TraceCheckUtils]: 113: Hoare triple {5212#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5213#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 16:38:09,884 INFO L290 TraceCheckUtils]: 114: Hoare triple {5213#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5213#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 16:38:09,885 INFO L290 TraceCheckUtils]: 115: Hoare triple {5213#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5213#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 16:38:09,885 INFO L290 TraceCheckUtils]: 116: Hoare triple {5213#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5214#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 16:38:09,886 INFO L290 TraceCheckUtils]: 117: Hoare triple {5214#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5214#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 16:38:09,886 INFO L290 TraceCheckUtils]: 118: Hoare triple {5214#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5214#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 16:38:09,887 INFO L290 TraceCheckUtils]: 119: Hoare triple {5214#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5215#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 16:38:09,887 INFO L290 TraceCheckUtils]: 120: Hoare triple {5215#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5215#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 16:38:09,888 INFO L290 TraceCheckUtils]: 121: Hoare triple {5215#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5215#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 16:38:09,888 INFO L290 TraceCheckUtils]: 122: Hoare triple {5215#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5216#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-27 16:38:09,889 INFO L290 TraceCheckUtils]: 123: Hoare triple {5216#(and (<= main_~x~0 39) (<= 39 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5216#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-27 16:38:09,889 INFO L290 TraceCheckUtils]: 124: Hoare triple {5216#(and (<= main_~x~0 39) (<= 39 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5216#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-27 16:38:09,890 INFO L290 TraceCheckUtils]: 125: Hoare triple {5216#(and (<= main_~x~0 39) (<= 39 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5217#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} is VALID [2022-04-27 16:38:09,890 INFO L290 TraceCheckUtils]: 126: Hoare triple {5217#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5217#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} is VALID [2022-04-27 16:38:09,891 INFO L290 TraceCheckUtils]: 127: Hoare triple {5217#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5173#false} is VALID [2022-04-27 16:38:09,891 INFO L290 TraceCheckUtils]: 128: Hoare triple {5173#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5173#false} is VALID [2022-04-27 16:38:09,891 INFO L290 TraceCheckUtils]: 129: Hoare triple {5173#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5173#false} is VALID [2022-04-27 16:38:09,891 INFO L290 TraceCheckUtils]: 130: Hoare triple {5173#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5173#false} is VALID [2022-04-27 16:38:09,891 INFO L290 TraceCheckUtils]: 131: Hoare triple {5173#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5173#false} is VALID [2022-04-27 16:38:09,891 INFO L290 TraceCheckUtils]: 132: Hoare triple {5173#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5173#false} is VALID [2022-04-27 16:38:09,891 INFO L290 TraceCheckUtils]: 133: Hoare triple {5173#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5173#false} is VALID [2022-04-27 16:38:09,891 INFO L290 TraceCheckUtils]: 134: Hoare triple {5173#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5173#false} is VALID [2022-04-27 16:38:09,891 INFO L290 TraceCheckUtils]: 135: Hoare triple {5173#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5173#false} is VALID [2022-04-27 16:38:09,892 INFO L290 TraceCheckUtils]: 136: Hoare triple {5173#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5173#false} is VALID [2022-04-27 16:38:09,892 INFO L290 TraceCheckUtils]: 137: Hoare triple {5173#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5173#false} is VALID [2022-04-27 16:38:09,892 INFO L290 TraceCheckUtils]: 138: Hoare triple {5173#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {5173#false} is VALID [2022-04-27 16:38:09,892 INFO L272 TraceCheckUtils]: 139: Hoare triple {5173#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {5173#false} is VALID [2022-04-27 16:38:09,892 INFO L290 TraceCheckUtils]: 140: Hoare triple {5173#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5173#false} is VALID [2022-04-27 16:38:09,892 INFO L290 TraceCheckUtils]: 141: Hoare triple {5173#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {5173#false} is VALID [2022-04-27 16:38:09,892 INFO L290 TraceCheckUtils]: 142: Hoare triple {5173#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5173#false} is VALID [2022-04-27 16:38:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 447 proven. 2420 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 16:38:09,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:38:09,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187651932] [2022-04-27 16:38:09,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187651932] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:38:09,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349896436] [2022-04-27 16:38:09,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 16:38:09,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:38:09,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:38:09,900 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:38:09,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 16:38:09,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 16:38:09,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:38:09,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 103 conjunts are in the unsatisfiable core [2022-04-27 16:38:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:38:10,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:38:12,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {5172#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5172#true} is VALID [2022-04-27 16:38:12,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {5172#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5172#true} is VALID [2022-04-27 16:38:12,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {5172#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5172#true} is VALID [2022-04-27 16:38:12,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5172#true} {5172#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5172#true} is VALID [2022-04-27 16:38:12,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {5172#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5172#true} is VALID [2022-04-27 16:38:12,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {5172#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {5237#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {5237#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5237#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {5237#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5237#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {5237#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5247#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {5247#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5247#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {5247#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5247#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {5247#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5257#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 16:38:12,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {5257#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5257#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 16:38:12,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {5257#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5257#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 16:38:12,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {5257#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5267#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {5267#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5267#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {5267#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5267#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {5267#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5277#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 16:38:12,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {5277#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5277#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 16:38:12,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {5277#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5277#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 16:38:12,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {5277#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5287#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 16:38:12,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {5287#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5287#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 16:38:12,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {5287#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5287#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 16:38:12,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {5287#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5297#(and (= main_~x~0 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {5297#(and (= main_~x~0 6) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5297#(and (= main_~x~0 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {5297#(and (= main_~x~0 6) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5297#(and (= main_~x~0 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {5297#(and (= main_~x~0 6) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5307#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {5307#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5307#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {5307#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5307#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {5307#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5317#(and (= 5000000 main_~z~0) (= main_~x~0 8))} is VALID [2022-04-27 16:38:12,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {5317#(and (= 5000000 main_~z~0) (= main_~x~0 8))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5317#(and (= 5000000 main_~z~0) (= main_~x~0 8))} is VALID [2022-04-27 16:38:12,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {5317#(and (= 5000000 main_~z~0) (= main_~x~0 8))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5317#(and (= 5000000 main_~z~0) (= main_~x~0 8))} is VALID [2022-04-27 16:38:12,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {5317#(and (= 5000000 main_~z~0) (= main_~x~0 8))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5327#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,991 INFO L290 TraceCheckUtils]: 33: Hoare triple {5327#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5327#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {5327#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5327#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,992 INFO L290 TraceCheckUtils]: 35: Hoare triple {5327#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5337#(and (= main_~x~0 10) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,992 INFO L290 TraceCheckUtils]: 36: Hoare triple {5337#(and (= main_~x~0 10) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5337#(and (= main_~x~0 10) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {5337#(and (= main_~x~0 10) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5337#(and (= main_~x~0 10) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {5337#(and (= main_~x~0 10) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5347#(and (= main_~x~0 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {5347#(and (= main_~x~0 11) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5347#(and (= main_~x~0 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,994 INFO L290 TraceCheckUtils]: 40: Hoare triple {5347#(and (= main_~x~0 11) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5347#(and (= main_~x~0 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {5347#(and (= main_~x~0 11) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5357#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {5357#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5357#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {5357#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5357#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {5357#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5367#(and (= main_~x~0 13) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,996 INFO L290 TraceCheckUtils]: 45: Hoare triple {5367#(and (= main_~x~0 13) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5367#(and (= main_~x~0 13) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,996 INFO L290 TraceCheckUtils]: 46: Hoare triple {5367#(and (= main_~x~0 13) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5367#(and (= main_~x~0 13) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,996 INFO L290 TraceCheckUtils]: 47: Hoare triple {5367#(and (= main_~x~0 13) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5377#(and (= main_~x~0 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,997 INFO L290 TraceCheckUtils]: 48: Hoare triple {5377#(and (= main_~x~0 14) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5377#(and (= main_~x~0 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,997 INFO L290 TraceCheckUtils]: 49: Hoare triple {5377#(and (= main_~x~0 14) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5377#(and (= main_~x~0 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,997 INFO L290 TraceCheckUtils]: 50: Hoare triple {5377#(and (= main_~x~0 14) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5387#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,998 INFO L290 TraceCheckUtils]: 51: Hoare triple {5387#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5387#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,998 INFO L290 TraceCheckUtils]: 52: Hoare triple {5387#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5387#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:12,999 INFO L290 TraceCheckUtils]: 53: Hoare triple {5387#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5397#(and (= 5000000 main_~z~0) (= main_~x~0 16))} is VALID [2022-04-27 16:38:12,999 INFO L290 TraceCheckUtils]: 54: Hoare triple {5397#(and (= 5000000 main_~z~0) (= main_~x~0 16))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5397#(and (= 5000000 main_~z~0) (= main_~x~0 16))} is VALID [2022-04-27 16:38:13,000 INFO L290 TraceCheckUtils]: 55: Hoare triple {5397#(and (= 5000000 main_~z~0) (= main_~x~0 16))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5397#(and (= 5000000 main_~z~0) (= main_~x~0 16))} is VALID [2022-04-27 16:38:13,001 INFO L290 TraceCheckUtils]: 56: Hoare triple {5397#(and (= 5000000 main_~z~0) (= main_~x~0 16))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5407#(and (= main_~x~0 17) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,001 INFO L290 TraceCheckUtils]: 57: Hoare triple {5407#(and (= main_~x~0 17) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5407#(and (= main_~x~0 17) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,001 INFO L290 TraceCheckUtils]: 58: Hoare triple {5407#(and (= main_~x~0 17) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5407#(and (= main_~x~0 17) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,002 INFO L290 TraceCheckUtils]: 59: Hoare triple {5407#(and (= main_~x~0 17) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5417#(and (= main_~x~0 18) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,002 INFO L290 TraceCheckUtils]: 60: Hoare triple {5417#(and (= main_~x~0 18) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5417#(and (= main_~x~0 18) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,002 INFO L290 TraceCheckUtils]: 61: Hoare triple {5417#(and (= main_~x~0 18) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5417#(and (= main_~x~0 18) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,003 INFO L290 TraceCheckUtils]: 62: Hoare triple {5417#(and (= main_~x~0 18) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5427#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,003 INFO L290 TraceCheckUtils]: 63: Hoare triple {5427#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5427#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,003 INFO L290 TraceCheckUtils]: 64: Hoare triple {5427#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5427#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,004 INFO L290 TraceCheckUtils]: 65: Hoare triple {5427#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5437#(and (= main_~x~0 20) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,004 INFO L290 TraceCheckUtils]: 66: Hoare triple {5437#(and (= main_~x~0 20) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5437#(and (= main_~x~0 20) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,004 INFO L290 TraceCheckUtils]: 67: Hoare triple {5437#(and (= main_~x~0 20) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5437#(and (= main_~x~0 20) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,006 INFO L290 TraceCheckUtils]: 68: Hoare triple {5437#(and (= main_~x~0 20) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5447#(and (= 5000000 main_~z~0) (= main_~x~0 21))} is VALID [2022-04-27 16:38:13,007 INFO L290 TraceCheckUtils]: 69: Hoare triple {5447#(and (= 5000000 main_~z~0) (= main_~x~0 21))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5447#(and (= 5000000 main_~z~0) (= main_~x~0 21))} is VALID [2022-04-27 16:38:13,007 INFO L290 TraceCheckUtils]: 70: Hoare triple {5447#(and (= 5000000 main_~z~0) (= main_~x~0 21))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5447#(and (= 5000000 main_~z~0) (= main_~x~0 21))} is VALID [2022-04-27 16:38:13,007 INFO L290 TraceCheckUtils]: 71: Hoare triple {5447#(and (= 5000000 main_~z~0) (= main_~x~0 21))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5457#(and (= main_~x~0 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,008 INFO L290 TraceCheckUtils]: 72: Hoare triple {5457#(and (= main_~x~0 22) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5457#(and (= main_~x~0 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,008 INFO L290 TraceCheckUtils]: 73: Hoare triple {5457#(and (= main_~x~0 22) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5457#(and (= main_~x~0 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,009 INFO L290 TraceCheckUtils]: 74: Hoare triple {5457#(and (= main_~x~0 22) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5467#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,011 INFO L290 TraceCheckUtils]: 75: Hoare triple {5467#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5467#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,011 INFO L290 TraceCheckUtils]: 76: Hoare triple {5467#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5467#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,012 INFO L290 TraceCheckUtils]: 77: Hoare triple {5467#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5477#(and (= main_~x~0 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,012 INFO L290 TraceCheckUtils]: 78: Hoare triple {5477#(and (= main_~x~0 24) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5477#(and (= main_~x~0 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,012 INFO L290 TraceCheckUtils]: 79: Hoare triple {5477#(and (= main_~x~0 24) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5477#(and (= main_~x~0 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,013 INFO L290 TraceCheckUtils]: 80: Hoare triple {5477#(and (= main_~x~0 24) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5487#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,013 INFO L290 TraceCheckUtils]: 81: Hoare triple {5487#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5487#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,013 INFO L290 TraceCheckUtils]: 82: Hoare triple {5487#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5487#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,014 INFO L290 TraceCheckUtils]: 83: Hoare triple {5487#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5497#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,014 INFO L290 TraceCheckUtils]: 84: Hoare triple {5497#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5497#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,014 INFO L290 TraceCheckUtils]: 85: Hoare triple {5497#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5497#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,015 INFO L290 TraceCheckUtils]: 86: Hoare triple {5497#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5507#(and (= main_~x~0 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,015 INFO L290 TraceCheckUtils]: 87: Hoare triple {5507#(and (= main_~x~0 27) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5507#(and (= main_~x~0 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,016 INFO L290 TraceCheckUtils]: 88: Hoare triple {5507#(and (= main_~x~0 27) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5507#(and (= main_~x~0 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,016 INFO L290 TraceCheckUtils]: 89: Hoare triple {5507#(and (= main_~x~0 27) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5517#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,016 INFO L290 TraceCheckUtils]: 90: Hoare triple {5517#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5517#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,017 INFO L290 TraceCheckUtils]: 91: Hoare triple {5517#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5517#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,017 INFO L290 TraceCheckUtils]: 92: Hoare triple {5517#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5527#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,017 INFO L290 TraceCheckUtils]: 93: Hoare triple {5527#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5527#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,018 INFO L290 TraceCheckUtils]: 94: Hoare triple {5527#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5527#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,018 INFO L290 TraceCheckUtils]: 95: Hoare triple {5527#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5537#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} is VALID [2022-04-27 16:38:13,018 INFO L290 TraceCheckUtils]: 96: Hoare triple {5537#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5537#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} is VALID [2022-04-27 16:38:13,019 INFO L290 TraceCheckUtils]: 97: Hoare triple {5537#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5537#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} is VALID [2022-04-27 16:38:13,019 INFO L290 TraceCheckUtils]: 98: Hoare triple {5537#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5547#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,019 INFO L290 TraceCheckUtils]: 99: Hoare triple {5547#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5547#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,020 INFO L290 TraceCheckUtils]: 100: Hoare triple {5547#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5547#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,020 INFO L290 TraceCheckUtils]: 101: Hoare triple {5547#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5557#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,020 INFO L290 TraceCheckUtils]: 102: Hoare triple {5557#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5557#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,021 INFO L290 TraceCheckUtils]: 103: Hoare triple {5557#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5557#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,021 INFO L290 TraceCheckUtils]: 104: Hoare triple {5557#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5567#(and (= main_~x~0 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,021 INFO L290 TraceCheckUtils]: 105: Hoare triple {5567#(and (= main_~x~0 33) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5567#(and (= main_~x~0 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,022 INFO L290 TraceCheckUtils]: 106: Hoare triple {5567#(and (= main_~x~0 33) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5567#(and (= main_~x~0 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,022 INFO L290 TraceCheckUtils]: 107: Hoare triple {5567#(and (= main_~x~0 33) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5577#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,023 INFO L290 TraceCheckUtils]: 108: Hoare triple {5577#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5577#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,023 INFO L290 TraceCheckUtils]: 109: Hoare triple {5577#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5577#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,023 INFO L290 TraceCheckUtils]: 110: Hoare triple {5577#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5587#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,024 INFO L290 TraceCheckUtils]: 111: Hoare triple {5587#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5587#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,024 INFO L290 TraceCheckUtils]: 112: Hoare triple {5587#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5587#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,024 INFO L290 TraceCheckUtils]: 113: Hoare triple {5587#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5597#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} is VALID [2022-04-27 16:38:13,025 INFO L290 TraceCheckUtils]: 114: Hoare triple {5597#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5597#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} is VALID [2022-04-27 16:38:13,025 INFO L290 TraceCheckUtils]: 115: Hoare triple {5597#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5597#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} is VALID [2022-04-27 16:38:13,025 INFO L290 TraceCheckUtils]: 116: Hoare triple {5597#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5607#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,026 INFO L290 TraceCheckUtils]: 117: Hoare triple {5607#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5607#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,026 INFO L290 TraceCheckUtils]: 118: Hoare triple {5607#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5607#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,026 INFO L290 TraceCheckUtils]: 119: Hoare triple {5607#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5617#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,027 INFO L290 TraceCheckUtils]: 120: Hoare triple {5617#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5617#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,027 INFO L290 TraceCheckUtils]: 121: Hoare triple {5617#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5617#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,028 INFO L290 TraceCheckUtils]: 122: Hoare triple {5617#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5627#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} is VALID [2022-04-27 16:38:13,028 INFO L290 TraceCheckUtils]: 123: Hoare triple {5627#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5627#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} is VALID [2022-04-27 16:38:13,028 INFO L290 TraceCheckUtils]: 124: Hoare triple {5627#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5627#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} is VALID [2022-04-27 16:38:13,029 INFO L290 TraceCheckUtils]: 125: Hoare triple {5627#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5637#(and (= 40 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,029 INFO L290 TraceCheckUtils]: 126: Hoare triple {5637#(and (= 40 main_~x~0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5637#(and (= 40 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 16:38:13,030 INFO L290 TraceCheckUtils]: 127: Hoare triple {5637#(and (= 40 main_~x~0) (= 5000000 main_~z~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5644#(and (= 40 main_~x~0) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 16:38:13,031 INFO L290 TraceCheckUtils]: 128: Hoare triple {5644#(and (= 40 main_~x~0) (= 5000000 (+ (- 1) main_~z~0)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5648#(and (= 5000000 (+ (- 1) main_~z~0)) (= 41 main_~x~0))} is VALID [2022-04-27 16:38:13,032 INFO L290 TraceCheckUtils]: 129: Hoare triple {5648#(and (= 5000000 (+ (- 1) main_~z~0)) (= 41 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5648#(and (= 5000000 (+ (- 1) main_~z~0)) (= 41 main_~x~0))} is VALID [2022-04-27 16:38:13,032 INFO L290 TraceCheckUtils]: 130: Hoare triple {5648#(and (= 5000000 (+ (- 1) main_~z~0)) (= 41 main_~x~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5655#(and (= 5000002 main_~z~0) (= 41 main_~x~0))} is VALID [2022-04-27 16:38:13,033 INFO L290 TraceCheckUtils]: 131: Hoare triple {5655#(and (= 5000002 main_~z~0) (= 41 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5659#(and (= 41 (+ (- 1) main_~x~0)) (= 5000002 main_~z~0))} is VALID [2022-04-27 16:38:13,037 INFO L290 TraceCheckUtils]: 132: Hoare triple {5659#(and (= 41 (+ (- 1) main_~x~0)) (= 5000002 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5659#(and (= 41 (+ (- 1) main_~x~0)) (= 5000002 main_~z~0))} is VALID [2022-04-27 16:38:13,037 INFO L290 TraceCheckUtils]: 133: Hoare triple {5659#(and (= 41 (+ (- 1) main_~x~0)) (= 5000002 main_~z~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5666#(and (= 41 (+ (- 1) main_~x~0)) (= 5000003 main_~z~0))} is VALID [2022-04-27 16:38:13,038 INFO L290 TraceCheckUtils]: 134: Hoare triple {5666#(and (= 41 (+ (- 1) main_~x~0)) (= 5000003 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5670#(and (= 5000003 main_~z~0) (= 41 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 16:38:13,038 INFO L290 TraceCheckUtils]: 135: Hoare triple {5670#(and (= 5000003 main_~z~0) (= 41 (+ (- 2) main_~x~0)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5670#(and (= 5000003 main_~z~0) (= 41 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 16:38:13,038 INFO L290 TraceCheckUtils]: 136: Hoare triple {5670#(and (= 5000003 main_~z~0) (= 41 (+ (- 2) main_~x~0)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5677#(and (= 41 (+ (- 2) main_~x~0)) (= 5000004 main_~z~0))} is VALID [2022-04-27 16:38:13,039 INFO L290 TraceCheckUtils]: 137: Hoare triple {5677#(and (= 41 (+ (- 2) main_~x~0)) (= 5000004 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5681#(and (= 44 main_~x~0) (= 5000004 main_~z~0))} is VALID [2022-04-27 16:38:13,039 INFO L290 TraceCheckUtils]: 138: Hoare triple {5681#(and (= 44 main_~x~0) (= 5000004 main_~z~0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {5681#(and (= 44 main_~x~0) (= 5000004 main_~z~0))} is VALID [2022-04-27 16:38:13,040 INFO L272 TraceCheckUtils]: 139: Hoare triple {5681#(and (= 44 main_~x~0) (= 5000004 main_~z~0))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {5688#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:38:13,040 INFO L290 TraceCheckUtils]: 140: Hoare triple {5688#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5692#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:38:13,040 INFO L290 TraceCheckUtils]: 141: Hoare triple {5692#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {5173#false} is VALID [2022-04-27 16:38:13,041 INFO L290 TraceCheckUtils]: 142: Hoare triple {5173#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5173#false} is VALID [2022-04-27 16:38:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:38:13,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:38:17,410 INFO L290 TraceCheckUtils]: 142: Hoare triple {5173#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5173#false} is VALID [2022-04-27 16:38:17,410 INFO L290 TraceCheckUtils]: 141: Hoare triple {5692#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {5173#false} is VALID [2022-04-27 16:38:17,411 INFO L290 TraceCheckUtils]: 140: Hoare triple {5688#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5692#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:38:17,411 INFO L272 TraceCheckUtils]: 139: Hoare triple {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {5688#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:38:17,411 INFO L290 TraceCheckUtils]: 138: Hoare triple {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:38:17,412 INFO L290 TraceCheckUtils]: 137: Hoare triple {5715#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:38:17,420 INFO L290 TraceCheckUtils]: 136: Hoare triple {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5715#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:38:17,420 INFO L290 TraceCheckUtils]: 135: Hoare triple {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:38:17,421 INFO L290 TraceCheckUtils]: 134: Hoare triple {5715#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:38:17,431 INFO L290 TraceCheckUtils]: 133: Hoare triple {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5715#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:38:17,431 INFO L290 TraceCheckUtils]: 132: Hoare triple {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:38:17,432 INFO L290 TraceCheckUtils]: 131: Hoare triple {5715#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:38:17,438 INFO L290 TraceCheckUtils]: 130: Hoare triple {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5715#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:38:17,439 INFO L290 TraceCheckUtils]: 129: Hoare triple {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:38:17,439 INFO L290 TraceCheckUtils]: 128: Hoare triple {5715#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:38:17,480 INFO L290 TraceCheckUtils]: 127: Hoare triple {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5715#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:38:17,480 INFO L290 TraceCheckUtils]: 126: Hoare triple {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:38:17,480 INFO L290 TraceCheckUtils]: 125: Hoare triple {5715#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5708#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:38:17,481 INFO L290 TraceCheckUtils]: 124: Hoare triple {5715#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5715#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:38:17,481 INFO L290 TraceCheckUtils]: 123: Hoare triple {5715#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5715#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:38:17,482 INFO L290 TraceCheckUtils]: 122: Hoare triple {5761#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5715#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 16:38:17,482 INFO L290 TraceCheckUtils]: 121: Hoare triple {5761#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5761#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,482 INFO L290 TraceCheckUtils]: 120: Hoare triple {5761#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5761#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,483 INFO L290 TraceCheckUtils]: 119: Hoare triple {5771#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5761#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,483 INFO L290 TraceCheckUtils]: 118: Hoare triple {5771#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5771#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,484 INFO L290 TraceCheckUtils]: 117: Hoare triple {5771#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5771#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,484 INFO L290 TraceCheckUtils]: 116: Hoare triple {5781#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5771#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,485 INFO L290 TraceCheckUtils]: 115: Hoare triple {5781#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5781#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 16:38:17,485 INFO L290 TraceCheckUtils]: 114: Hoare triple {5781#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5781#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 16:38:17,485 INFO L290 TraceCheckUtils]: 113: Hoare triple {5791#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5781#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 16:38:17,486 INFO L290 TraceCheckUtils]: 112: Hoare triple {5791#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5791#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:38:17,486 INFO L290 TraceCheckUtils]: 111: Hoare triple {5791#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5791#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:38:17,487 INFO L290 TraceCheckUtils]: 110: Hoare triple {5801#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5791#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:38:17,487 INFO L290 TraceCheckUtils]: 109: Hoare triple {5801#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5801#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 16:38:17,487 INFO L290 TraceCheckUtils]: 108: Hoare triple {5801#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5801#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 16:38:17,488 INFO L290 TraceCheckUtils]: 107: Hoare triple {5811#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5801#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 16:38:17,488 INFO L290 TraceCheckUtils]: 106: Hoare triple {5811#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5811#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:38:17,489 INFO L290 TraceCheckUtils]: 105: Hoare triple {5811#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5811#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:38:17,489 INFO L290 TraceCheckUtils]: 104: Hoare triple {5821#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5811#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:38:17,490 INFO L290 TraceCheckUtils]: 103: Hoare triple {5821#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5821#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 16:38:17,490 INFO L290 TraceCheckUtils]: 102: Hoare triple {5821#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5821#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 16:38:17,491 INFO L290 TraceCheckUtils]: 101: Hoare triple {5831#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5821#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 16:38:17,491 INFO L290 TraceCheckUtils]: 100: Hoare triple {5831#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5831#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 16:38:17,492 INFO L290 TraceCheckUtils]: 99: Hoare triple {5831#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5831#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 16:38:17,492 INFO L290 TraceCheckUtils]: 98: Hoare triple {5841#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5831#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 16:38:17,493 INFO L290 TraceCheckUtils]: 97: Hoare triple {5841#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5841#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,493 INFO L290 TraceCheckUtils]: 96: Hoare triple {5841#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5841#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,494 INFO L290 TraceCheckUtils]: 95: Hoare triple {5851#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5841#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,494 INFO L290 TraceCheckUtils]: 94: Hoare triple {5851#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5851#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,494 INFO L290 TraceCheckUtils]: 93: Hoare triple {5851#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5851#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,495 INFO L290 TraceCheckUtils]: 92: Hoare triple {5861#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5851#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,495 INFO L290 TraceCheckUtils]: 91: Hoare triple {5861#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5861#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 16:38:17,495 INFO L290 TraceCheckUtils]: 90: Hoare triple {5861#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5861#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 16:38:17,497 INFO L290 TraceCheckUtils]: 89: Hoare triple {5871#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5861#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 16:38:17,497 INFO L290 TraceCheckUtils]: 88: Hoare triple {5871#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5871#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 16:38:17,497 INFO L290 TraceCheckUtils]: 87: Hoare triple {5871#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5871#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 16:38:17,498 INFO L290 TraceCheckUtils]: 86: Hoare triple {5881#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5871#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 16:38:17,498 INFO L290 TraceCheckUtils]: 85: Hoare triple {5881#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5881#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,499 INFO L290 TraceCheckUtils]: 84: Hoare triple {5881#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5881#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,499 INFO L290 TraceCheckUtils]: 83: Hoare triple {5891#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5881#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,500 INFO L290 TraceCheckUtils]: 82: Hoare triple {5891#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5891#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 16:38:17,500 INFO L290 TraceCheckUtils]: 81: Hoare triple {5891#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5891#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 16:38:17,504 INFO L290 TraceCheckUtils]: 80: Hoare triple {5901#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5891#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 16:38:17,504 INFO L290 TraceCheckUtils]: 79: Hoare triple {5901#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5901#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,504 INFO L290 TraceCheckUtils]: 78: Hoare triple {5901#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5901#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,505 INFO L290 TraceCheckUtils]: 77: Hoare triple {5911#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5901#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,506 INFO L290 TraceCheckUtils]: 76: Hoare triple {5911#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5911#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 16:38:17,506 INFO L290 TraceCheckUtils]: 75: Hoare triple {5911#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5911#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 16:38:17,507 INFO L290 TraceCheckUtils]: 74: Hoare triple {5921#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5911#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 16:38:17,508 INFO L290 TraceCheckUtils]: 73: Hoare triple {5921#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5921#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,508 INFO L290 TraceCheckUtils]: 72: Hoare triple {5921#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5921#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,509 INFO L290 TraceCheckUtils]: 71: Hoare triple {5931#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5921#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,509 INFO L290 TraceCheckUtils]: 70: Hoare triple {5931#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5931#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,510 INFO L290 TraceCheckUtils]: 69: Hoare triple {5931#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5931#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,510 INFO L290 TraceCheckUtils]: 68: Hoare triple {5941#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5931#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,511 INFO L290 TraceCheckUtils]: 67: Hoare triple {5941#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5941#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-27 16:38:17,511 INFO L290 TraceCheckUtils]: 66: Hoare triple {5941#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5941#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-27 16:38:17,512 INFO L290 TraceCheckUtils]: 65: Hoare triple {5951#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5941#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-27 16:38:17,513 INFO L290 TraceCheckUtils]: 64: Hoare triple {5951#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5951#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} is VALID [2022-04-27 16:38:17,513 INFO L290 TraceCheckUtils]: 63: Hoare triple {5951#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5951#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} is VALID [2022-04-27 16:38:17,514 INFO L290 TraceCheckUtils]: 62: Hoare triple {5961#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5951#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} is VALID [2022-04-27 16:38:17,514 INFO L290 TraceCheckUtils]: 61: Hoare triple {5961#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5961#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,515 INFO L290 TraceCheckUtils]: 60: Hoare triple {5961#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5961#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,516 INFO L290 TraceCheckUtils]: 59: Hoare triple {5971#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5961#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,516 INFO L290 TraceCheckUtils]: 58: Hoare triple {5971#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5971#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,517 INFO L290 TraceCheckUtils]: 57: Hoare triple {5971#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5971#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,517 INFO L290 TraceCheckUtils]: 56: Hoare triple {5981#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5971#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,518 INFO L290 TraceCheckUtils]: 55: Hoare triple {5981#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5981#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} is VALID [2022-04-27 16:38:17,518 INFO L290 TraceCheckUtils]: 54: Hoare triple {5981#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5981#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} is VALID [2022-04-27 16:38:17,519 INFO L290 TraceCheckUtils]: 53: Hoare triple {5991#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5981#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} is VALID [2022-04-27 16:38:17,519 INFO L290 TraceCheckUtils]: 52: Hoare triple {5991#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5991#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} is VALID [2022-04-27 16:38:17,520 INFO L290 TraceCheckUtils]: 51: Hoare triple {5991#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5991#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} is VALID [2022-04-27 16:38:17,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {6001#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5991#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} is VALID [2022-04-27 16:38:17,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {6001#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6001#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {6001#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6001#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,522 INFO L290 TraceCheckUtils]: 47: Hoare triple {6011#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6001#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,523 INFO L290 TraceCheckUtils]: 46: Hoare triple {6011#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6011#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {6011#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6011#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {6021#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6011#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,524 INFO L290 TraceCheckUtils]: 43: Hoare triple {6021#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6021#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,525 INFO L290 TraceCheckUtils]: 42: Hoare triple {6021#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6021#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {6031#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6021#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {6031#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6031#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:38:17,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {6031#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6031#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:38:17,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {6041#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6031#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:38:17,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {6041#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6041#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:38:17,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {6041#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6041#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:38:17,529 INFO L290 TraceCheckUtils]: 35: Hoare triple {6051#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6041#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:38:17,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {6051#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6051#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {6051#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6051#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {6061#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6051#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {6061#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6061#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,531 INFO L290 TraceCheckUtils]: 30: Hoare triple {6061#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6061#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {6071#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6061#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {6071#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6071#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} is VALID [2022-04-27 16:38:17,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {6071#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6071#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} is VALID [2022-04-27 16:38:17,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {6081#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6071#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} is VALID [2022-04-27 16:38:17,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {6081#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6081#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-27 16:38:17,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {6081#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6081#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-27 16:38:17,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {6091#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6081#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-27 16:38:17,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {6091#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6091#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {6091#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6091#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {6101#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6091#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {6101#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6101#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {6101#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6101#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {6111#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6101#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {6111#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6111#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} is VALID [2022-04-27 16:38:17,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {6111#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6111#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} is VALID [2022-04-27 16:38:17,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {6121#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6111#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} is VALID [2022-04-27 16:38:17,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {6121#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6121#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {6121#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6121#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {6131#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6121#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 16:38:17,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {6131#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6131#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} is VALID [2022-04-27 16:38:17,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {6131#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6131#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} is VALID [2022-04-27 16:38:17,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {6141#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6131#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} is VALID [2022-04-27 16:38:17,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {6141#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6141#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:38:17,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {6141#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6141#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:38:17,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {5172#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {6141#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:38:17,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {5172#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5172#true} is VALID [2022-04-27 16:38:17,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5172#true} {5172#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5172#true} is VALID [2022-04-27 16:38:17,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {5172#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5172#true} is VALID [2022-04-27 16:38:17,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {5172#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5172#true} is VALID [2022-04-27 16:38:17,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {5172#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5172#true} is VALID [2022-04-27 16:38:17,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2856 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 16:38:17,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349896436] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:38:17,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:38:17,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 53, 45] total 136 [2022-04-27 16:38:17,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532542986] [2022-04-27 16:38:17,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:38:17,549 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 136 states have (on average 2.889705882352941) internal successors, (393), 134 states have internal predecessors, (393), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2022-04-27 16:38:17,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:38:17,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 136 states, 136 states have (on average 2.889705882352941) internal successors, (393), 134 states have internal predecessors, (393), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:38:17,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 400 edges. 400 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:38:17,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-04-27 16:38:17,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:38:17,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-04-27 16:38:17,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=15960, Unknown=0, NotChecked=0, Total=18360 [2022-04-27 16:38:17,851 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand has 136 states, 136 states have (on average 2.889705882352941) internal successors, (393), 134 states have internal predecessors, (393), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:38:31,612 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= (mod (+ 40 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:38:33,625 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= (mod (+ 40 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:38:35,688 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= (mod (+ 40 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:38:37,865 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:38:40,284 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:38:42,384 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:38:44,398 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:38:46,410 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:38:48,421 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:38:50,434 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:38:52,696 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:38:54,822 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:38:56,835 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:38:58,846 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:00,870 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:02,887 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:04,902 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:06,915 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:08,928 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:10,940 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:12,976 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:14,994 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:17,018 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:19,035 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:21,048 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:23,067 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:25,081 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:27,094 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:29,107 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:31,121 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:33,134 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:35,161 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:37,174 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:39,189 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:41,205 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:43,215 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:45,229 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:39:47,243 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 16:43:50,232 WARN L232 SmtUtils]: Spent 1.29m on a formula simplification that was a NOOP. DAG size: 115 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 16:43:57,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:43:59,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:44:04,076 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:44:15,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:44:18,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:44:20,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:44:22,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:44:24,046 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:44:26,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:44:28,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:48:24,539 WARN L232 SmtUtils]: Spent 1.46m on a formula simplification that was a NOOP. DAG size: 119 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 16:48:26,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:48:28,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:48:30,562 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:48:32,572 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:48:34,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:48:45,160 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:48:52,937 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:48:54,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:48:58,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:49:02,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:49:04,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:49:06,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:49:11,669 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:49:13,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:49:15,680 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:49:17,691 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:49:19,705 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:49:21,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:49:23,717 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:49:25,724 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:49:27,731 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:49:29,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []